Modeling Paths for Explainable Knowledge Base Completion
A common approach in knowledge base completion (KBC) is to learn representations for entities and relations in order to infer missing facts by generalizing existing ones. A shortcoming of standard models is that they do not explain their predictions to make them verifiable easily to human inspection. In this paper, we propose the Context Path Model (CPM) which generates explanations for new facts in KBC by providing sets of \textit{context paths} as supporting evidence for these triples. For example, a new triple (Theresa May, nationality, Britain) may be explained by the path (Theresa May, born in, Eastbourne, contained in, Britain). The CPM is formulated as a wrapper that can be applied on top of various existing KBC models. We evaluate it for the well-established TransE model. We observe that its performance remains very close despite the added complexity, and that most of the paths proposed as explanations provide meaningful evidence to assess the correctness.
Code (1)
Tasks
Knowledge Base CompletionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Faithful Path Language Modeling for Explainable Recommendation over Knowledge Graph
The integration of path reasoning with language modeling in recommender systems has shown promise for enhancing explainability but often struggles with the authenticity of the explanations provided. Traditional models mo…
Explainable RecommendationKnowledge Graph EmbeddingsKnowledge GraphsLanguage Modeling+3Modeling relation paths for knowledge base completion via joint adversarial training
Knowledge Base Completion (KBC), which aims at determining the missing relations between entity pairs, has received increasing attention in recent years. Most existing KBC methods focus on either embedding the Knowledge …
Knowledge Base CompletionRelationOxKBC: Outcome Explanation for Factorization Based Knowledge Base Completion
State-of-the-art models for Knowledge Base Completion (KBC) are based on tensor factorization (TF), e.g, DistMult, ComplEx. While they produce good results, they cannot expose any rationale behind their predictions, pote…
Automated Theorem ProvingKnowledge Base CompletionModeling Relation Paths for Representation Learning of Knowledge Bases
Representation learning of knowledge bases (KBs) aims to embed both entities and relations into a low-dimensional space. Most existing methods only consider direct relations in representation learning. We argue that mult…
Knowledge Base CompletionRelationRelation ExtractionRepresentation Learning+1Reasoning Over Paths via Knowledge Base Completion
Reasoning over paths in large scale knowledge graphs is an important problem for many applications. In this paper we discuss a simple approach to automatically build and rank paths between a source and target entity pair…
Knowledge Base CompletionKnowledge Graphs