An Interpretable Knowledge Transfer Model for Knowledge Base Completion
Knowledge bases are important resources for a variety of natural language processing tasks but suffer from incompleteness. We propose a novel embedding model, \emph{ITransF}, to perform knowledge base completion. Equipped with a sparse attention mechanism, ITransF discovers hidden concepts of relations and transfer statistical strength through the sharing of concepts. Moreover, the learned associations between relations and concepts, which are represented by sparse attention vectors, can be interpreted easily. We evaluate ITransF on two benchmark datasets---WN18 and FB15k for knowledge base completion and obtains improvements on both the mean rank and Hits@10 metrics, over all baselines that do not use additional information.
Code (0)
등록된 구현이 없습니다.
Tasks
Knowledge Base CompletionTransfer LearningSimilar Papers 제목 키워드 기반
KTNet: Knowledge Transfer for Unpaired 3D Shape Completion
Unpaired 3D object completion aims to predict a complete 3D shape from an incomplete input without knowing the correspondence between the complete and incomplete shapes. In this paper, we propose the novel KTNet to solve…
Point Cloud CompletionTransfer LearningCoDEx: A Comprehensive Knowledge Graph Completion Benchmark
We present CoDEx, a set of knowledge graph completion datasets extracted from Wikidata and Wikipedia that improve upon existing knowledge graph completion benchmarks in scope and level of difficulty. In terms of scope, C…
BenchmarkingKnowledge Graph CompletionKnowledge GraphsLink Prediction+1PALT: Parameter-Lite Transfer of Language Models for Knowledge Graph Completion
This paper presents a parameter-lite transfer learning approach of pretrained language models (LM) for knowledge graph (KG) completion. Instead of finetuning, which modifies all LM parameters, we only tune a few new para…
Knowledge Graph CompletionLink PredictionTransfer LearningLogical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning
Probabilistic logical rule learning has shown great strength in logical rule mining and knowledge graph completion. It learns logical rules to predict missing edges by reasoning on existing edges in the knowledge graph. …
Knowledge Graph CompletionKnowledge GraphsLink 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 Prediction