Reasoning 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 with learned embeddings using a knowledge base completion model (KBC). We assembled a knowledge graph by mining the available biomedical scientific literature and extracted a set of high frequency paths to use for validation. We demonstrate that our method is able to effectively rank a list of known paths between a pair of entities and also come up with plausible paths that are not present in the knowledge graph. For a given entity pair we are able to reconstruct the highest ranking path 60% of the time within the the top 10 ranked paths and achieve 49% mean average precision. Our approach is compositional since any KBC model that can produce vector representations of entities can be used.
Code (0)
등록된 구현이 없습니다.
Tasks
Knowledge Base CompletionKnowledge GraphsSimilar Papers 제목 키워드 기반
Dynamic Anticipation and Completion for Multi-Hop Reasoning over Sparse Knowledge Graph
Multi-hop reasoning has been widely studied in recent years to seek an effective and interpretable method for knowledge graph (KG) completion. Most previous reasoning methods are designed for dense KGs with enough paths …
Soft Reasoning Paths for Knowledge Graph Completion
Reasoning paths are reliable information in knowledge graph completion (KGC) in which algorithms can find strong clues of the actual relation between entities. However, in real-world applications, it is difficult to guar…
Knowledge Graph CompletionRelationRecurrent One-Hop Predictions for Reasoning over Knowledge Graphs
Large scale knowledge graphs (KGs) such as Freebase are generally incomplete. Reasoning over multi-hop (mh) KG paths is thus an important capability that is needed for question answering or other NLP tasks that require k…
Knowledge Base CompletionKnowledge GraphsQuestion AnsweringRelationExploring & Exploiting High-Order Graph Structure for Sparse Knowledge Graph Completion
Sparse knowledge graph (KG) scenarios pose a challenge for previous Knowledge Graph Completion (KGC) methods, that is, the completion performance decreases rapidly with the increase of graph sparsity. This problem is als…
Knowledge Graph CompletionLogical ReasoningDiscover Important Paths in the Knowledge Graph Based on Dynamic Relation Confidence
Most of the existing knowledge graphs are not usually complete and can be complemented by some reasoning algorithms. The reasoning method based on path features is widely used in the field of knowledge graph reasoning an…
Knowledge GraphsRelation