Exploring long tail data in distantly supervised relation extraction

8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Distant supervision is an efficient approach for various tasks, such as relation extraction. Most of the recent literature on distantly supervised relation extraction generates labeled data by heuristically aligning knowledge bases with text corpora and then trains supervised relation classification models based on statistical learning. However, extracting long tail relations from the automatically labeled data is still a challenging problem even in big data. Inspired by explanation-based learning (EBL), this paper proposes an EBL-based approach to tackle this problem. The proposed approach can learn relation extraction rules effectively using unlabeled data. Experiments on the New York Times corpus demonstrate that our approach outperforms the baseline approach especially on long tail data.

Cite

CITATION STYLE

APA

Gui, Y., Liu, Q., Zhu, M., & Gao, Z. (2016). Exploring long tail data in distantly supervised relation extraction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10102, pp. 514–522). Springer Verlag. https://doi.org/10.1007/978-3-319-50496-4_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free