3.8 Proceedings Paper

Predicting Completeness in Knowledge Bases

出版社

ASSOC COMPUTING MACHINERY
DOI: 10.1145/3018661.3018739

关键词

Knowledge bases; Quality; Incompleteness; Recall

资金

  1. project MAGIC
  2. Province of Bozen-Bolzano
  3. TQTK
  4. Free University of Bozen-Bolzano

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据