A Probabilistic Algorithm to Predict Missing Facts from Knowledge Graphs

Knowledge Graph, as the name says, is a way to represent knowledge using a directed graph structure (nodes and edges). However, such graphs are often incomplete or contain a considerable amount of wrong facts. This work presents ProA: a probabilistic algorithm to predict missing facts from Knowledge Graphs based on the probability distribution over paths between entities. Compared to current state-of-the-art approaches, ProA has the following advantages: simplicity as it considers only the topological structure of a knowledge graph, good performance as it does not require any complex calculations, and readiness as it has no other requirement but the graph itself.