Enhancing Knowledge Graph Completion with Entity Neighborhood and Relation Context
Knowledge Graph Completion (KGC) aims to infer missing information in Knowledge Graphs (KGs) to address their inherent incompleteness. Traditional structure-based KGC methods, while effective, face significant computational demands and scalability challenges due to the need for dense embedding learning and scoring all entities in the KG for each prediction. Recent text-based approaches using language models like T5 and BERT have mitigated these issues by converting KG triples into text for reasoning. However, they often fail to fully utilize contextual information, focusing mainly on the neighborhood of the entity and neglecting the context of the relation. To address this issue, we propose KGC-ERC, a framework that integrates both types of context to enrich the input of generative language models and enhance their reasoning capabilities. Additionally, we introduce a sampling strategy to effectively select relevant context within input token constraints, which optimizes the utilization of contextual information and potentially improves model performance. Experiments on the Wikidata5M, Wiki27K, and FB15K-237-N datasets show that KGC-ERC outperforms or matches state-of-the-art baselines in predictive performance and scalability.
Code (0)
등록된 구현이 없습니다.
Tasks
Knowledge Graph CompletionKnowledge GraphsRelationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
NNKGC: Improving Knowledge Graph Completion with Node Neighborhoods
Knowledge graph completion (KGC) aims to discover missing relations of query entities. Current text-based models utilize the entity name and description to infer the tail entity given the head entity and a certain relati…
Knowledge Graph CompletionLink PredictionA2N: Attending to Neighbors for Knowledge Graph Inference
State-of-the-art models for knowledge graph completion aim at learning a fixed embedding representation of entities in a multi-relational graph which can generalize to infer unseen entity relationships at test time. This…
Knowledge Graph CompletionLink PredictionRelational Message Passing for Knowledge Graph Completion
Knowledge graph completion aims to predict missing relations between entities in a knowledge graph. In this work, we propose a relational message passing method for knowledge graph completion. Different from existing emb…
Knowledge Graph CompletionRelationRelation PredictionLogic Attention Based Neighborhood Aggregation for Inductive Knowledge Graph Embedding
Knowledge graph embedding aims at modeling entities and relations with low-dimensional vectors. Most previous methods require that all entities should be seen during training, which is unpractical for real-world knowledg…
Graph EmbeddingKnowledge Graph CompletionKnowledge Graph EmbeddingKnowledge Graphs+1Neighborhood Mixture Model for Knowledge Base Completion
Knowledge bases are useful resources for many natural language processing tasks, however, they are far from complete. In this paper, we define a novel entity representation as a mixture of its neighborhood in the knowled…
General ClassificationKnowledge Base CompletionmodelPrediction+2