The DOI matches its OpenAlex record; 19 of the 19 references it cites were found in a registry or an index.
Random Walk Inference and Learning in A Large Scale Knowledge Base
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Combining labeled and unlabeled data with co-training
Blum, A., & Mitchell, T. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279962 · Cited by 5,495
Self-citationRichardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676
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-citationHaveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Probabilistic Robotics (Intelligent Robotics and Autonomous Agents)
Thrun, S., Burgard, W., & Fox, D. (2005) · The MIT Press eBooks · Cited by 1,422
Open information extraction from the web
Banko, M., Cafarella, M., Soderland, S. G., Broadhead, M., & Etzioni, O. (2007) · International Joint Conference on Artificial Intelligence · Cited by 1,398
Snowball: extracting relations from large plain-text collections
Agichtein, E., & Gravano, L. (2000) · Proceedings of the fifth ACM conference on Digital libraries · doi:10.1145/336597.336644 · Cited by 1,147
Unsupervised named-entity extraction from the Web: An experimental study
Etzioni, O., Cafarella, M., Downey, D., Popescu, A.-M., Shaked, T., Soderland, S., Weld, D. S., & Yates, A. (2005) · Artificial Intelligence · doi:10.1016/j.artint.2005.03.001 · Cited by 1,124
Keyword searching and browsing in databases using BANKS
Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., & Sudarshan, S. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994756 · Cited by 871
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 614
Self-citationEspresso: leveraging generic patterns for automatically harvesting semantic relations
Pantel, P., & Pennacchiotti, M. (2006) · Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL - ACL '06 · doi:10.3115/1220175.1220190 · Cited by 529
Quinlan, J. R., & Cameron-Jones, R. M. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-56602-3_124 · Cited by 528
Semantic taxonomy induction from heterogenous evidence
Snow, R., Jurafsky, D., & Ng, A. Y. (2006) · Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL - ACL '06 · doi:10.3115/1220175.1220276 · Cited by 441
TextRunner: open information extraction on the web
Yates, A., Cafarella, M., Banko, M., Etzioni, O., Broadhead, M., & Soderland, S. (2007) · Proceedings of Human Language Technologies: The Annual Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations on XX - NAACL '07 · doi:10.3115/1614164.1614177 · Cited by 326
Learning relations by pathfinding
Richards, B. L., & Mooney, R. J. (1992) · Cited by 144
Fast query execution for retrieval models based on path-constrained random walks
Lao, N., & Cohen, W. W. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835916 · Cited by 100
Self-citationPolynomial learnability and Inductive Logic Programming: Methods and results
Cohen, W. W., & Page, C. D. (1995) · New Generation Computing · doi:10.1007/bf03037231 · Cited by 59
Self-citationScaling textual inference to the web
Schoenmackers, S., Etzioni, O., & Weld, D. S. (2008) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/1613715.1613727 · Cited by 55
Cafarella, M., Banko, M., & Etzioni, O. (2006) · Cited by 45
Cited by
A Review of Relational Machine Learning for Knowledge Graphs
Nickel, M., Murphy, K., Tresp, V., & Gabrilovich, E. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2483592 · Cited by 1,638
Knowledge vault: a web-scale approach to probabilistic knowledge fusion
Dong, X., Gabrilovich, E., Heitz, G., Horn, W., Lao, N., Murphy, K., Strohmann, T., Sun, S., & Zhang, W. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623623 · Cited by 1,533
Self-citationSemantic Parsing on Freebase from Question-Answer Pairs
Berant, J., Chou, A., Frostig, R., & Liang, P. (2013) · Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d13-1160 · Cited by 1,517
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
Metadata
- Authors
- Lao, N., Mitchell, T. M., & Cohen, W. W.
- Venue
- Figshare
- Publisher
- Figshare (United Kingdom)
- Published
- 2018-06-29
- Pages
- 529-539
- OpenAlex
- W1756422141
- Cited by
- 482
- References
- 19
- FWCI
- 36.64
- Type
- journal article
- Language
- en
- Open access
- green
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.