Representativeness of Knowledge Bases with the Generalized Benford’s Law

Arnaud Soulet (1) , Arnaud Giacometti (1) , Béatrice Bouchou Markhoff (1) , Fabian M. Suchanek (2)

1 BDTLN - Bases de données et traitement des langues naturelles
2 LTCI - Laboratoire Traitement et Communication de l'Information

Knowledge bases (KBs) such as DBpedia, Wikidata, and YAGO contain a huge number of entities and facts. Several recent works induce rules or calculate statistics on these KBs. Most of these methods are based on the assumption that the data is a representative sample of the studied universe. Unfortunately, KBs are biased because they are built from crowdsourcing and opportunistic agglomeration of available databases. This paper aims at approximating the representativeness of a relation within a knowledge base. For this, we use the generalized Benford's law, which indicates the distribution expected by the facts of a relation. We then compute the minimum number of facts that have to be added in order to make the KB representative of the real world. Experiments show that our unsupervised method applies to a large number of relations. For numerical relations where ground truths exist, the estimated representativeness proves to be a reliable indicator.

Domaines: Web; Base de données [cs.DB]

Arnaud Soulet, Arnaud Giacometti, Béatrice Bouchou Markhoff, Fabian M. Suchanek. Representativeness of Knowledge Bases with the Generalized Benford’s Law. ISWC, Oct 2018, Monterey, CA, United States. ⟨hal-01824490⟩