Improving Relation Classification by Entity Pair Graph
Relation classification is one of the most important tasks in the field of information extraction, and also a key component of systems that require relational understanding of unstructured text. Existing relation classification approaches mainly rely on exploiting external resources and background knowledge to improve the performance and ignore the correlations between entity pairs which are helpful for relation classification. We present the concept of entity pair graph to represent the correlations between entity pairs and propose a novel entity pair graph based neural network (EPGNN) model, relying on graph convolutional network to capture the topological features of an entity pair graph. EPGNN combines sentence semantic features generated by pre-trained BERT model with graph topological features for relation classification. Our proposed model makes full use of a given corpus and forgoes the need of external resources and background knowledge. The experimental results on two widely used dataset: SemEval 2010 Task 8 and ACE 2005, show that our method outperforms the state-of-the-art approaches.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationGeneral ClassificationRelationRelation ClassificationRelation ExtractionSentenceMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Document-Level Relation Extraction with Reconstruction
In document-level relation extraction (DocRE), graph structure is generally used to encode relation information in the input document to classify the relation category between each entity pair, and has greatly advanced t…
Document-level Relation ExtractionRelationRelation ClassificationRelation ExtractionCoarse-to-Fine Entity Representations for Document-level Relation Extraction
Document-level Relation Extraction (RE) requires extracting relations expressed within and across sentences. Recent works show that graph-based methods, usually constructing a document-level graph that captures document-…
Document-level Relation ExtractionRelationRelation ExtractionP-INT: A Path-based Interaction Model for Few-shot Knowledge Graph Completion
Few-shot knowledge graph completion is to infer the unknown facts (i.e., query head-tail entity pairs) of a given relation with only a few observed reference entity pairs. Its general process is to first encode the impli…
Knowledge Graph CompletionRelationRelDiff: Enriching Knowledge Graph Relation Representations for Sensitivity Classification
The relationships that exist between entities can be a reliable indicator for classifying sensitive information, such as commercially sensitive information. For example, the relation person-IsDirectorOf-company can indic…
Entity EmbeddingsKnowledge Graph EmbeddingsRelationSensitivity+2Joint Multimodal Entity-Relation Extraction Based on Edge-enhanced Graph Alignment Network and Word-pair Relation Tagging
Multimodal named entity recognition (MNER) and multimodal relation extraction (MRE) are two fundamental subtasks in the multimodal knowledge graph construction task. However, the existing methods usually handle two tasks…
graph constructionnamed-entity-recognitionNamed Entity RecognitionNamed Entity Recognition (NER)+3