Improving Neural Relation Extraction with Implicit Mutual Relations
Relation extraction (RE) aims at extracting the relation between two entities from the text corpora. It is a crucial task for Knowledge Graph (KG) construction. Most existing methods predict the relation between an entity pair by learning the relation from the training sentences, which contain the targeted entity pair. In contrast to existing distant supervision approaches that suffer from insufficient training corpora to extract relations, our proposal of mining implicit mutual relation from the massive unlabeled corpora transfers the semantic information of entity pairs into the RE model, which is more expressive and semantically plausible. After constructing an entity proximity graph based on the implicit mutual relations, we preserve the semantic relations of entity pairs via embedding each vertex of the graph into a low-dimensional space. As a result, we can easily and flexibly integrate the implicit mutual relations and other entity information, such as entity types, into the existing RE methods. Our experimental results on a New York Times and another Google Distant Supervision datasets suggest that our proposed neural RE framework provides a promising improvement for the RE task, and significantly outperforms the state-of-the-art methods. Moreover, the component for mining implicit mutual relations is so flexible that can help to improve the performance of both CNN-based and RNN-based RE models significant.
Code (1)
Tasks
RelationRelation ExtractionSimilar Papers 제목 키워드 기반
Argument Pair Extraction with Mutual Guidance and Inter-sentence Relation Graph
Argument pair extraction (APE) aims to extract interactive argument pairs from two passages of a discussion. Previous work studied this task in the context of peer review and rebuttal, and decomposed it into a sequence l…
Argument Pair Extraction (APE)RelationRelation ClassificationSentenceLearning Relation Ties with a Force-Directed Graph in Distant Supervised Relation Extraction
Relation ties, defined as the correlation and mutual exclusion between different relations, are critical for distant supervised relation extraction. Existing approaches model this property by greedily learning local depe…
RelationRelation ExtractionBridging Text and Knowledge with Multi-Prototype Embedding for Few-Shot Relational Triple Extraction
Current supervised relational triple extraction approaches require huge amounts of labeled data and thus suffer from poor performance in few-shot settings. However, people can grasp new knowledge by learning a few instan…
A Relational Triple Extraction Method Based on Feature Reasoning for Technological Patents
The relation triples extraction method based on table filling can address the issues of relation overlap and bias propagation. However, most of them only establish separate table features for each relationship, which ign…
RelationMutually Guided Few-shot Learning for Relational Triple Extraction
Knowledge graphs (KGs), containing many entity-relation-entity triples, provide rich information for downstream applications. Although extracting triples from unstructured texts has been widely explored, most of them req…
Cross-Domain Few-ShotDecoderFew-Shot LearningKnowledge Graphs+2