Tuple refinement method based on relationship keyword extension

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

Abstract

Entity relation extraction is mainly focused on researching extraction approaches and improving precision of the extraction results. Although many efforts have been made on this field, there still exist some problems. In order to improve the performance of extracting entity relation, we propose a tuple refinement method based on relationship keyword extension. Firstly, we utilize the diversity of relationships to extend relationship keywords, and then, use the redundancy of network information to extract the second entity based on the principle of proximity and the predefined entity type. Under open web environment, we take four relationships in the experiments and adopt bootstrapping algorithm to acquire the initial tuple set. Three tuple refinement methods are compared: refinement method with threshold set, refinement method with relation extension and refinement method without relation extension. The average F-scores of the experimental results show the proposed method can effectively improve the performance of entity relation extraction. © Springer-Verlag Berlin Heidelberg 2012.

Cite

CITATION STYLE

APA

Yang, X., Yang, J., & Chen, C. (2012). Tuple refinement method based on relationship keyword extension. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7529 LNCS, pp. 564–571). https://doi.org/10.1007/978-3-642-33469-6_70

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