Next Article in Journal
High Performance Methods for Linked Open Data Connectivity Analytics
Previous Article in Journal
An Agent-Based Approach to Interbank Market Lending Decisions and Risk Implications
Article Menu

Export Article

Open AccessArticle

A Machine Learning Filter for the Slot Filling Task

1
Polytechnique Montréal, Computer Engineering and Software Engineering, The WeST Lab, Montreal, QC H3T 1J4, Canada
2
School of Electrical Engineering and Computer Science, University of Ottawa, School of Electrical Engineering and Computer Science, The WeST Lab, Ottawa, ON K1N 6N5, Canada
3
Netmail Inc., 180 Peel Street, Montreal, QC H3C 2G7, Canada
*
Author to whom correspondence should be addressed.
Current address: University of Ottawa, School of Electrical Engineering and Computer Science, Ottawa, ON K1N 6N5, Canada.
These authors contributed equally to this work.
Information 2018, 9(6), 133; https://doi.org/10.3390/info9060133
Received: 13 April 2018 / Revised: 25 May 2018 / Accepted: 25 May 2018 / Published: 30 May 2018
(This article belongs to the Section Artificial Intelligence)
  |  
PDF [707 KB, uploaded 30 May 2018]
  |  

Abstract

Slot Filling, a subtask of Relation Extraction, represents a key aspect for building structured knowledge bases usable for semantic-based information retrieval. In this work, we present a machine learning filter whose aim is to enhance the precision of relation extractors while minimizing the impact on the recall. Our approach consists in the filtering of relation extractors’ output using a binary classifier. This classifier is based on a wide array of features including syntactic, semantic and statistical features such as the most frequent part-of-speech patterns or the syntactic dependencies between entities. We experimented the classifier on the 18 participating systems in the TAC KBP 2013 English Slot Filling track. The TAC KBP English Slot Filling track is an evaluation campaign that targets the extraction of 41 pre-identified relations (e.g., title, date of birth, countries of residence, etc.) related to specific named entities (persons and organizations). Our results show that the classifier is able to improve the global precision of the best 2013 system by 20.5% and improve the F1-score for 20 relations out of 33 considered. View Full-Text
Keywords: information retrieval; information extraction; relation extraction; slot filling; knowledge base population; most frequent patterns; precision; data mining information retrieval; information extraction; relation extraction; slot filling; knowledge base population; most frequent patterns; precision; data mining
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Lange Di Cesare, K.; Zouaq, A.; Gagnon, M.; Jean-Louis, L. A Machine Learning Filter for the Slot Filling Task. Information 2018, 9, 133.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Information EISSN 2078-2489 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top