Knowledge graph refinement: A survey of approaches and evaluation methods

• Published in: Semantic Web Vol. 8; no. 3; pp. 489 - 508
• Main Author: Paulheim, Heiko
• Format: Journal Article
• Language: English
• Published: London Sage Publications Ltd 01.01.2017
• Subjects: Graphs; Knowledge; Statistical methods
• ISSN: 1570-0844; 2210-4968
• DOI: 10.3233/SW-160218

In the recent years, different Web knowledge graphs, both free and commercial, have been created. While Google coined the term “Knowledge Graph” in 2012, there are also a few openly available knowledge graphs, with DBpedia, YAGO, and Freebase being among the most prominent ones. Those graphs are often constructed from semi-structured knowledge, such as Wikipedia, or harvested from the web with a combination of statistical and linguistic methods. The result are large-scale knowledge graphs that try to make a good trade-off between completeness and correctness. In order to further increase the utility of such knowledge graphs, various refinement methods have been proposed, which try to infer and add missing knowledge to the graph, or identify erroneous pieces of information. In this article, we provide a survey of such knowledge graph refinement approaches, with a dual look at both the methods being proposed as well as the evaluation methodologies used.