The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Incorporating Vector Space Similarity in Random Walk Inference over Knowledge Bases
Open accessAbstract
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.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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?
The cited source says what the claim attributes to it.
In the citing paper
“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.
Citations
Cites
Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank
Socher, R., Perelygin, A., Wu, J., Chuang, J., Manning, C. D., Ng, A., & Potts, C. (2013) · Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d13-1170 · Cited by 6,878
Freebase: a collaboratively created graph database for structuring human knowledge
Bollacker, K., Evans, C., Paritosh, P., Sturge, T., & Taylor, J. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376746 · Cited by 4,852
Yago: a core of semantic knowledge
Suchanek, F. M., Kasneci, G., & Weikum, G. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242667 · Cited by 2,512
Toward an architecture for never-ending language learning
Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Hruschka, E., & Mitchell, T. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7519 · Cited by 2,000
Self-citationLenat, D. B. (1995) · Communications of the ACM · doi:10.1145/219717.219745 · Cited by 1,966
ConceptNet — A Practical Commonsense Reasoning Tool-Kit
Liu, H., & Singh, P. (2004) · BT Technology Journal · doi:10.1023/b:bttj.0000047600.45421.6d · Cited by 1,570
GraphChi: Large-Scale Graph Computation on Just a PC
Kyrola, A., Blelloch, G. E., & Guestrin, C. (2018) · Figshare · doi:10.1184/r1/6605999 · Cited by 868
Parsing with Compositional Vector Grammars
Socher, R., Bauer, J., Manning, C. D., & Ng, A. Y. (2013) · Cited by 830
Open Language Learning for Information Extraction
Schmitz, M., Soderland, S. G., Bart, R., & Etzioni, O. (2012) · Cited by 694
Relational retrieval using a combination of path-constrained random walks
Lao, N., & Cohen, W. W. (2010) · Machine Learning · doi:10.1007/s10994-010-5205-8 · Cited by 616
Relation Extraction with Matrix Factorization and Universal Schemas
Riedel, S., Yao, L., McCallum, A., & Marlin, B. M. (2013) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 570
Knowledge base completion via search-based question answering
West, R., Gabrilovich, E., Murphy, K., Sun, S., Gupta, R., & Lin, D. (2014) · Proceedings of the 23rd international conference on World wide web · doi:10.1145/2566486.2568032 · Cited by 305
Lexicon Infused Phrase Embeddings for Named Entity Resolution
Passos, A., Kumar, V., & McCallum, A. (2015) · Cited by 277
DBpedia: A Multilingual Cross-domain Knowledge Base
Mendes, P. N., Max Jakob, E., & Bizer, C. (2012) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/4b94v6njihis · Cited by 155
Improving Learning and Inference in a Large Knowledge-Base using Latent Syntactic Cues
Gardner, M., Talukdar, P. P., Kisiel, B., & Mitchell, T. M. (2013) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d13-1080 · Cited by 93
Self-citationReading The Web with Learned Syntactic-Semantic Inference Rules
Lao, N., Subramanya, A., Pereira, F. M. B., & Cohen, W. W. (2018) · doi:10.1184/r1/6476270 · Cited by 76
Programming with personalized pagerank
Wang, W. Y., Mazaitis, K., & Cohen, W. W. (2013) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2505515.2505573 · Cited by 72
Acquiring temporal constraints between relations
Talukdar, P. P., Wijaya, D. T., & Mitchell, T. M. (2012) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2396761.2396886 · Cited by 47
Self-citationProgramming with Personalized PageRank: A Locally Groundable First-Order Probabilistic LogicPreprint
Wang, W. Y., Mazaitis, K., & Cohen, W. W. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1305.2254 · Cited by 34
Research works printed but not linked: 1
- Douglas B Lenat. 1995. Cyc: A large-scale investment in knowledge infrastructure. Communications of the ACM, 38(11):33-38.
Cited by
Sorted by citations
A Survey on Knowledge Graphs: Representation, Acquisition, and Applications
Ji, S., Pan, S., Cambria, E., Marttinen, P., & Yu, P. S. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3070843 · Cited by 2,947
Observed versus latent features for knowledge base and text inference
Toutanova, K., & Chen, D. (2015) · Proceedings of the 3rd Workshop on Continuous Vector Space Models and their Compositionality · doi:10.18653/v1/w15-4007 · Cited by 1,070
A review: Knowledge reasoning over knowledge graph
Chen, X., Jia, S., & Xiang, Y. (2020) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.112948 · Cited by 1,035
DeepPath: A Reinforcement Learning Method for Knowledge Graph Reasoning
Xiong, W., Hoang, T., & Wang, W. Y. (2017) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d17-1060 · Cited by 953
Representing Text for Joint Embedding of Text and Knowledge Bases
Toutanova, K., Chen, D., Pantel, P., Poon, H., Choudhury, P., & Gamon, M. (2015) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d15-1174 · Cited by 827
Metadata
- 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
- hybrid
- doi.org
- 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
