Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Demand-Weighted Completeness Prediction for a Knowledge Base (1804.11109v1)

Published 30 Apr 2018 in cs.AI and cs.CL

Abstract: In this paper we introduce the notion of Demand-Weighted Completeness, allowing estimation of the completeness of a knowledge base with respect to how it is used. Defining an entity by its classes, we employ usage data to predict the distribution over relations for that entity. For example, instances of person in a knowledge base may require a birth date, name and nationality to be considered complete. These predicted relation distributions enable detection of important gaps in the knowledge base, and define the required facts for unseen entities. Such characterisation of the knowledge base can also quantify how usage and completeness change over time. We demonstrate a method to measure Demand-Weighted Completeness, and show that a simple neural network model performs well at this prediction task.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Andrew Hopkinson (3 papers)
  2. Amit Gurdasani (1 paper)
  3. Dave Palfrey (3 papers)
  4. Arpit Mittal (15 papers)
Citations (11)

Summary

We haven't generated a summary for this paper yet.