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 relation. Existing approaches also consider the neighborhood of the head entity. However, these methods tend to model the neighborhood using a flat structure and are only restricted to 1-hop neighbors. In this work, we propose a node neighborhood-enhanced framework for knowledge graph completion. It models the head entity neighborhood from multiple hops using graph neural networks to enrich the head node information. Moreover, we introduce an additional edge link prediction task to improve KGC. Evaluation on two public datasets shows that this framework is simple yet effective. The case study also shows that the model is able to predict explainable predictions.
Code (1)
Tasks
Knowledge Graph CompletionLink PredictionSimilar Papers 제목 키워드 기반
Better Together: Enhancing Generative Knowledge Graph Completion with Language Models and Neighborhood Information
Real-world Knowledge Graphs (KGs) often suffer from incompleteness, which limits their potential performance. Knowledge Graph Completion (KGC) techniques aim to address this issue. However, traditional KGC methods are co…
ImputationKnowledge Graph CompletionKnowledge GraphsWorld KnowledgeAssociation Rules Enhanced Knowledge Graph Attention Network
Most existing knowledge graphs suffer from incompleteness. Embedding knowledge graphs into continuous vector spaces has recently attracted increasing interest in knowledge base completion. However, in most existing embed…
Graph AttentionGraph EmbeddingKnowledge Base CompletionKnowledge Graph Completion+4Knowledge Graph Embedding via Graph Attenuated Attention Networks
Knowledge graphs contain a wealth of real-world knowledge that can provide strong support for artificial intelligence applications. Much progress has been made in knowledge graph completion, state-of-the-art models are b…
Graph EmbeddingKnowledge Base CompletionKnowledge Graph CompletionKnowledge Graph Embedding+5Scalable knowledge base completion with superposition memories
We present Harmonic Memory Networks (HMem), a neural architecture for knowledge base completion that models entities as weighted sums of pairwise bindings between an entity's neighbors and corresponding relations. Since …
Knowledge Base CompletionCommonsense Knowledge Base Completion with Structural and Semantic Context
Automatic KB completion for commonsense knowledge graphs (e.g., ATOMIC and ConceptNet) poses unique challenges compared to the much studied conventional knowledge bases (e.g., Freebase). Commonsense knowledge graphs use …
Computational EfficiencyKnowledge Base CompletionKnowledge GraphsLanguage Modelling+2