Completeness, Recall, and Negation in Open-World Knowledge Bases: A Survey
Authors:
- Simon RazniewskiSRSimon Razniewski
- Hiba ArnaoutHAHiba Arnaout
- Shrestha GhoshSGShrestha Ghosh
- Fabian SuchanekFSFabian Suchanek
Preprint
Abstract
General-purpose knowledge bases (KBs) are a cornerstone of knowledge-centric AI. Many of them are constructed pragmatically from Web sources, and are thus far from complete. This poses challenges for the consumption as well as the curation of their content. While several surveys target the problem of completing incomplete KBs, the first problem is arguably to know whether and where the KB is incomplete in the first place, and to which degree. In this survey we discuss how knowledge about completeness, recall, and negation in KBs can be expressed, extracted, and inferred. We cover (i) the logical foundations of knowledge representation and querying under partial closed-world semantics; (ii) the estimation of this information via statistical patterns; (iii) the extraction of information about recall from KBs and text; (iv) the identification of interesting negative statements; and (v) relaxed notions of relative recall. This survey is targeted at two types of audiences: (1) practitioners who are interested in tracking KB quality, focusing extraction efforts, and building quality-aware downstream applications; and (2) data management, knowledge base and semantic web researchers who wish to understand the state of the art of knowledge bases beyond the open-world assumption. Consequently, our survey presents both fundamental methodologies and their working, and gives practice-oriented recommendations on how to choose between different approaches for a problem at hand.Keywords
All Related Versions
This publication has 56 references indexed in Scilit:
- CounQER: A System for Discovering and Linking Count Information in Knowledge Bases2020
- SchemaTree: Maximum-Likelihood Property Recommendation for Wikidata2020
- Mining Significant Maximum Cardinalities in Knowledge Bases2019
- Enriching Knowledge Bases with Counting Quantifiers2018
- Representativeness of Knowledge Bases with the Generalized Benford’s Law2018
- Assessing the Completeness Evolution of DBpedia: A Case Study2017
- Assessing the Completeness of Entities in Knowledge Bases2017
- Doctoral Advisor or Medical Condition: Towards Entity-Specific Rankings of Knowledge Base Properties2017
- WebIsALOD: Providing Hypernymy Relations Extracted from the Web as Linked Open Data2017
- One Knowledge Graph to Rule Them All? Analyzing the Differences Between DBpedia, YAGO, Wikidata & co.2017