Query-based Instance Discrimination Network for Relational Triple Extraction
Joint entity and relation extraction has been a core task in the field of information extraction. Recent approaches usually consider the extraction of relational triples from a stereoscopic perspective, either learning a relation-specific tagger or separate classifiers for each relation type. However, they still suffer from error propagation, relation redundancy and lack of high-level connections between triples. To address these issues, we propose a novel query-based approach to construct instance-level representations for relational triples. By metric-based comparison between query embeddings and token embeddings, we can extract all types of triples in one step, thus eliminating the error propagation problem. In addition, we learn the instance-level representation of relational triples via contrastive learning. In this way, relational triples can not only enclose rich class-level semantics but also access to high-order global connections. Experimental results show that our proposed method achieves the state of the art on five widely used benchmarks.
Code (0)
등록된 구현이 없습니다.
Tasks
Contrastive LearningJoint Entity and Relation ExtractionRelationRelation ExtractionSimilar Papers 제목 키워드 기반
Bridging 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…
Multimodal Relational Triple Extraction with Query-based Entity Object Transformer
Multimodal Relation Extraction is crucial for constructing flexible and realistic knowledge graphs. Recent studies focus on extracting the relation type with entity pairs present in different modalities, such as one enti…
Knowledge GraphsObjectobject-detectionObject Detection+3Few-shot Knowledge Graph Relational Reasoning via Subgraph Adaptation
Few-shot Knowledge Graph (KG) Relational Reasoning aims to predict unseen triplets (i.e., query triplets) for rare relations in KGs, given only several triplets of these relations as references (i.e., support triplets). …
Knowledge GraphsRelational ReasoningMutually 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+2Few-shot Link Prediction on N-ary Facts
Hyper-relational facts, which consist of a primary triple (head entity, relation, tail entity) and auxiliary attribute-value pairs, are widely present in real-world Knowledge Graphs (KGs). Link Prediction on Hyper-relati…
AttributeKnowledge GraphsLink PredictionPrediction+2