Unsupervised graph-based relation extraction and validation for knowledge base population

Yu, Dian
Thumbnail Image
Other Contributors
Ji, Heng
Grishman, Ralph
McGuinness, Deborah L.
Fox, Peter A.
Issue Date
Computer science
Terms of Use
Attribution-NonCommercial-NoDerivs 3.0 United States
This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
Full Citation
To populate KBs, researchers have made significant progress in relation extraction from unstructured text corpora. However, it remains very challenging since a relation can be expressed in numerous ways through a sophisticated long-range linguistic structure. Previous successful methods require sufficient clean training data, external knowledge bases, or high-quality patterns, which result in extensive human involvement and poor portability to a new relation type or a different language. The consolidation of relations extracted by multiple relation extraction systems from multiple information sources may also generate erroneous, conflicting, redundant or complement results, which are caused by the differences in source trustability and the significant differences in performance among multiple systems. In many cases, certain facts can only be discovered by a minority of advanced systems from a few trustworthy sources. Therefore, it poses a challenge but also an opportunity for KB fact validation.
In this thesis, we aim to improve multilingual knowledge base population by designing unsupervised graph-based methods to extract and validate relations from unstructured textual data. We develop language/relation independent methods which can be adapted to a new language/relation with less effort. We want to further improve the performance of a single relation extraction system by incorporating evidence from multiple information sources and multiple systems. To evaluate the effectiveness of our approach, we choose Slot Filling as our evaluation platform, which aims to extract the values of a variety of predefined attributes for a given entity from a large-scale corpus and provide justification sentences to support these values.
Knowledge bases (KBs), which store millions of facts about the world, have been widely applied to a broad range of applications such as semantic search and question answering. Each relational fact contains two entities (e.g., person and location) and the relation between them. However, existing KBs are far from complete. Manually updated Wikipedia Infoboxes still serve as the important structured input for many large-scale KBs. Furthermore, completing KBs by inferring missing relations from existing structured data cannot completely solve this problem since KBs mainly focus on famous entities.
December 2017
School of Science
Dept. of Computer Science
Rensselaer Polytechnic Institute, Troy, NY
Rensselaer Theses and Dissertations Online Collection
CC BY-NC-ND. Users may download and share copies with attribution in accordance with a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License. No commercial use or derivatives are permitted without the explicit approval of the author.