Cited by 189Topic ModelingAdvanced Graph Neural NetworksSemantic Web and Ontologies

Incorporating Vector Space Similarity in Random Walk Inference over Knowledge Bases

Open access
Gardner, Matt, Talukdar, Partha, Krishnamurthy, Jayant, Mitchell, Tom·2014·Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)

Abstract

Much work in recent years has gone into the construction of large knowledge bases (KBs), such as Freebase, DBPedia, NELL, and YAGO.While these KBs are very large, they are still very incomplete, necessitating the use of inference to fill in gaps.Prior work has shown how to make use of a large text corpus to augment random walk inference over KBs.We present two improvements to the use of such large corpora to augment KB inference.First, we present a new technique for combining KB relations and surface text into a single graph representation that is much more compact than graphs used in prior work.Second, we describe how to incorporate vector space similarity into random walk inference over KBs, reducing the feature sparsity inherent in using surface text.This allows us to combine distributional similarity with symbolic logical inference in novel and effective ways.With experiments on many relations from two separate KBs, we show that our methods significantly outperform prior work on KB inference, both in the size of problem our methods can handle and in the quality of predictions made.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3115/v1/d14-1044

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • Unlike prior path ranking studies for KG completion that leverage entities and relations in the KG for path reasoning, our path ranking model additionally considers the relation phrase in the question for ranking.

    “Different from those studies using path ranking algorithm for KG completion (Lao et al., 2011;Gardner et al., 2014;Mazumder and Liu, 2017;Das et al., 2018), which leverage the entities and relations in the KG for path reasoning, our path ranking model additionally considers the relation phrase in the question for ranking.”

    From Implicit Relation Linking for Question Answering over Knowledge Graph (2022) · cites this paper as Gardner et al., 2014

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. Douglas B Lenat. 1995. Cyc: A large-scale investment in knowledge infrastructure. Communications of the ACM, 38(11):33-38.
  2. Fabian M Suchanek, Gjergji Kasneci, and Gerhard Weikum. 2007. Yago: a core of semantic knowl- edge. In Proceedings of WWW.

Cited by

Sorted by citations

Authors
Gardner, M., Talukdar, P., Krishnamurthy, J., & Mitchell, T.
Affiliations
  • Carnegie Mellon University (US)
  • Indian Institute of Science Bangalore (IN)
Venue
Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)
Published
2014
Pages
397-406
OpenAlex
W175897666
Cited by
189
References
19
Citations by year
2026: 4 · 2025: 11 · 2024: 18 · 2023: 9 · 2022: 19 · 2021: 17 · 2020: 18 · 2019: 28 · 2018: 19 · 2017: 14 · 2016: 14 · 2015: 15 · 2014: 2
FWCI
8.83
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
  • Conference on Empirical Methods in Natural Language Processing (EMNLP) (publishedVersion, cc-by)
  • Figshare (submittedVersion, cc-by)
  • KiltHub Repository (submittedVersion)
  • KiltHub Repository
Funders
  • National Science Foundation
  • Defense Advanced Research Projects Agency (FA8750-13-2-0005, FA8750)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Computer Science › Artificial Intelligence › Semantic Web and Ontologies
Keywords
knowledge base inference, random walks, knowledge base completion, graph representation, feature sparsity, distributional semantics

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