Path Ranking Algorithm
Related Papers
Random Walk Inference and Learning in A Large Scale Knowledge Base
We consider the problem of performing learn- ing and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference procedure based …...
Improving Learning and Inference in a Large Knowledge-Base using Latent Syntactic Cues
Automatically constructed Knowledge Bases (KBs) are often incomplete and there is a gen- uine need to improve their coverage. Path Ranking Algorithm (PRA) is a recently pro- posed method which …...
Efficient and Expressive Knowledge Base Completion Using Subgraph Feature Extraction
We explore some of the practicalities of using random walk inference meth- ods, such as the Path Ranking Algorithm (PRA), for the task of knowledge base completion. We show that …...
Knowledge Base Inference using Bridging Entities
Large-scale Knowledge Bases (such as NELL, Yago, Freebase, etc.) are often sparse, i.e., a large number of valid rela- tions between existing entities are missing. Recent research have addressed this …...
Knowledge Base Completion via Coupled Path Ranking
Knowledge bases (KBs) are often greatly incomplete, necessitating a demand for K- B completion. The path ranking algorith- m (PRA) is one of the most promising ap- proaches to this …...