Distant Supervision for Relation Extraction with Ranking-Based Methods†
AbstractRelation extraction has benefited from distant supervision in recent years with the development of natural language processing techniques and data explosion. However, distant supervision is still greatly limited by the quality of training data, due to its natural motivation for greatly reducing the heavy cost of data annotation. In this paper, we construct an architecture called MIML-sort (Multi-instance Multi-label Learning with Sorting Strategies), which is built on the famous MIML framework. Based on MIML-sort, we propose three ranking-based methods for sample selection with which we identify relation extractors from a subset of the training data. Experiments are set up on the KBP (Knowledge Base Propagation) corpus, one of the benchmark datasets for distant supervision, which is large and noisy. Compared with previous work, the proposed methods produce considerably better results. Furthermore, the three methods together achieve the best F1 on the official testing set, with an optimal enhancement of F1 from 27.3% to 29.98%. View Full-Text
Share & Cite This Article
Xiang, Y.; Chen, Q.; Wang, X.; Qin, Y. Distant Supervision for Relation Extraction with Ranking-Based Methods. Entropy 2016, 18, 204.
Xiang Y, Chen Q, Wang X, Qin Y. Distant Supervision for Relation Extraction with Ranking-Based Methods. Entropy. 2016; 18(6):204.Chicago/Turabian Style
Xiang, Yang; Chen, Qingcai; Wang, Xiaolong; Qin, Yang. 2016. "Distant Supervision for Relation Extraction with Ranking-Based Methods." Entropy 18, no. 6: 204.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.