Cited by 305Topic ModelingSemantic Web and OntologiesInformation Retrieval and Search Behavior

Knowledge base completion via search-based question answering

West, Robert, Gabrilovich, Evgeniy, Murphy, Kevin, Sun, Shaohua, Gupta, Rahul, Lin, Dekang·2014·Proceedings of the 23rd international conference on World wide web

Abstract

Over the past few years, massive amounts of world knowledge have been accumulated in publicly available knowledge bases, such as Freebase, NELL, and YAGO. Yet despite their seemingly huge size, these knowledge bases are greatly incomplete. For example, over 70% of people included in Freebase have no known place of birth, and 99% have no known ethnicity. In this paper, we propose a way to leverage existing Web-search-based question-answering technology to fill in the gaps in knowledge bases in a targeted way. In particular, for each entity attribute, we learn the best set of queries to ask, such that the answer snippets returned by the search engine are most likely to contain the correct value for that attribute. For example, if we want to find Frank Zappa's mother, we could ask the query `who is the mother of Frank Zappa'. However, this is likely to return `The Mothers of Invention', which was the name of his band. Our system learns that it should (in this case) add disambiguating terms, such as Zappa's place of birth, in order to make it more likely that the search results contain snippets mentioning his mother. Our system also learns how many different queries to ask for each attribute, since in some cases, asking too many can hurt accuracy (by introducing false positives). We discuss how to aggregate candidate answers across multiple queries, ultimately returning probabilistic predictions for possible values for each attribute. Finally, we evaluate our system and show that…

Integrity signals

Registry

Crossref · 10.1145/2566486.2568032

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Even state-of-the-art knowledge graphs suffer from incompleteness.

    “Despite such efforts, it is well known that even state-of-the-art KGs suffer from incompleteness .”

    From Knowledge Graph Embedding for Link Prediction (2021) · cites this paper as [69]

  • In FreeBase, over 70% of person entities have no known place of birth, and over 99% have no known ethnicity.

    “For instance, it has been observed that over 70% of person entities have no known place of birth, and over 99% have no known ethnicity [12, 69] in FreeBase, one of the largest and most widely used KGs for research purposes.”

    From Knowledge Graph Embedding for Link Prediction (2021) · cites this paper as [69]

Cited by

Sorted by citations

Authors
West, R., Gabrilovich, E., Murphy, K., Sun, S., Gupta, R., & Lin, D.
Affiliations
  • Stanford University (US)
  • Google (United States) (US)
Venue
Proceedings of the 23rd international conference on World wide web
Publisher
ACM
Published
2014-04-07
Pages
515-526
OpenAlex
W2128407051
Cited by
305
References
0
Citations by year
2026: 5 · 2025: 14 · 2024: 16 · 2023: 29 · 2022: 22 · 2021: 29 · 2020: 41 · 2019: 31 · 2018: 32 · 2017: 27 · 2016: 29 · 2015: 24 · 2014: 5 · 2012: 1
FWCI
16.54
Type
conference paper
Language
en
Open access
closed
Locations
International World Wide Web Conference (WWW) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Semantic Web and Ontologies
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
Keywords
knowledge base completion, query selection, ambiguity resolution, answer aggregation, probabilistic forecasting, entity linking, Freebase

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review