Reasoning Over Paths via Knowledge Base Completion

11/01/2019
by   Saatviga Sudhahar, et al.
0

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 achieve 49 model that can produce vector representations of entities can be used.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset