RECON: Relation Extraction using Knowledge Graph Context in a Graph Neural Network
In this paper, we present a novel method named RECON, that automatically identifies relations in a sentence (sentential relation extraction) and aligns to a knowledge graph (KG). RECON uses a graph neural network to learn representations of both the sentence as well as facts stored in a KG, improving the overall extraction quality. These facts, including entity attributes (label, alias, description, instance-of) and factual triples, have not been collectively used in the state of the art methods. We evaluate the effect of various forms of representing the KG context on the performance of RECON. The empirical evaluation on two standard relation extraction datasets shows that RECON significantly outperforms all state of the art methods on NYT Freebase and Wikidata datasets. RECON reports 87.23 F1 score (Vs 82.29 baseline) on Wikidata dataset whereas on NYT Freebase, reported values are 87.5(P@10) and 74.1(P@30) compared to the previous baseline scores of 81.3(P@10) and 63.1(P@30).
Code (1)
Tasks
Graph Neural NetworkRelationRelation ExtractionRelationship Extraction (Distant Supervised)SentenceMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Knowledge-Enhanced Relation Extraction Dataset
Recently, knowledge-enhanced methods leveraging auxiliary knowledge graphs have emerged in relation extraction, surpassing traditional text-based approaches. However, to our best knowledge, there is currently no public d…
Entity LinkingKnowledge GraphsRelationRelation Extraction+1Leveraging Knowledge Graph Embeddings to Enhance Contextual Representations for Relation Extraction
Relation extraction task is a crucial and challenging aspect of Natural Language Processing. Several methods have surfaced as of late, exhibiting notable performance in addressing the task; however, most of these approac…
Knowledge Graph EmbeddingsKnowledge GraphsRelationRelation Extraction+1SLIDE: Sliding Localized Information for Document Extraction
Constructing accurate knowledge graphs from long texts and low-resource languages is challenging, as large language models (LLMs) experience degraded performance with longer input chunks. This problem is amplified in low…
Chunkinggraph constructionKnowledge GraphsQuestion Answering+1Big Green at WNUT 2020 Shared Task-1: Relation Extraction as Contextualized Sequence Classification
Relation and event extraction is an important task in natural language processing. We introduce a system which uses contextualized knowledge graph completion to classify relations and events between known entities in a n…
Event ExtractionGeneral ClassificationKnowledge Graph CompletionRelation+1LLMs Underperform Graph-Based Parsers on Supervised Relation Extraction for Complex Graphs
Relation extraction represents a fundamental component in the process of creating knowledge graphs, among other applications. Large language models (LLMs) have been adopted as a promising tool for relation extraction, bo…
Relation ExtractionKnowledge Graphs