Predicting completeness in knowledge bases

Luis Galárraga, Simon Razniewski, Antoine Amarilli, Fabian M. Suchanek

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

81 Citations (Scopus)

Abstract

Knowledge bases such as Wikidata, DBpedia, or YAGO contain millions of entities and facts. In some knowledge bases, the correctness of these facts has been evaluated. However, much less is known about their completeness, i.e., the proportion of real facts that the knowledge bases cover. In this work, we investigate different signals to identify the areas where the knowledge base is complete. We show that we can combine these signals in a rule mining approach, which allows us to predict where facts may be missing. We also show that completeness predictions can help other applications such as fact inference.

Original languageEnglish
Title of host publicationWSDM 2017 - Proceedings of the 10th ACM International Conference on Web Search and Data Mining
Number of pages9
PublisherAssociation for Computing Machinery
Publication date2 Feb 2017
Pages375-383
ISBN (Electronic)9781450346757
DOIs
Publication statusPublished - 2 Feb 2017
Event10th ACM International Conference on Web Search and Data Mining, WSDM 2017 - Cambridge, United Kingdom
Duration: 6 Feb 201710 Feb 2017

Conference

Conference10th ACM International Conference on Web Search and Data Mining, WSDM 2017
Country/TerritoryUnited Kingdom
CityCambridge
Period06/02/201710/02/2017
SponsorACM SIGKDD, ACM SIGMOD, ACM SIGWEB, Special Interest Group on Information Retrieval (ACM SIGIR)

Keywords

  • Incompleteness
  • Knowledge bases
  • Quality
  • Recall

Fingerprint

Dive into the research topics of 'Predicting completeness in knowledge bases'. Together they form a unique fingerprint.

Cite this