Compositional Learning of Embeddings for Relation Paths in Knowledge Base and Text
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Modeling relation paths has offered significant gains in embedding models for knowledge base (KB) completion.However, enumerating paths between two entities is very expensive, and existing approaches typically resort to approximation with a sampled subset.This problem is particularly acute when text is jointly modeled with KB relations and used to provide direct evidence for facts mentioned in it.In this paper, we propose the first exact dynamic programming algorithm which enables efficient incorporation of all relation paths of bounded length, while modeling both relation types and intermediate nodes in the compositional path representations.We conduct a theoretical analysis of the efficiency gain from the approach.Experiments on two datasets show that it addresses representational limitations in prior approaches and improves accuracy in KB completion.
Overview
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
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 · cited 1×
“For example, large-scale knowledge bases (KB), such as Freebase (Bollacker et al., 2008) or DBPedia (Auer et al., 2007), have proven to be important resources for supporting open-domain question answering (Berant et al., 2013; Sun et al., 2015; Yih et al., 2015).”
BackgroundA direct adaptive method for faster backpropagation learning: the RPROP algorithm
Riedmiller, M., & Braun, H. (2002) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1993.298623 · Cited by 3,917 · cited 1×
“Implementation Details We used batch training with RProp (Riedmiller and Braun, 1993).”
MethodEmbedding Entities and Relations for Learning and Inference in Knowledge Bases
Yang, B., Yih, W.-T., He, X., Gao, J., & Deng, L. (2014) · arXiv · doi:10.48550/arxiv.1412.6575 · Cited by 2,252 · cited 1×
“…focuses on exploring various kinds of learning objectives and frameworks, but the model is learned solely from known direct relationships between two entities (e.g., father ( barack , sasha )) (Nickel et al., 2011; Socher et al., 2013; Bordes et al., 2013; Chang et al., 2014; Yang et al., 2015).”
BackgroundSelf-citationPID: the Pathway Interaction Database
Schaefer, C. F., Anthony, K., Krupa, S., Buchoff, J., Day, M., Hannay, T., & Buetow, K. H. (2009) · Nucleic Acids Research · doi:10.1093/nar/gkn653 · Cited by 1,603
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
Self-citationModeling Relation Paths for Representation Learning of Knowledge Bases
Lin, Y., Liu, Z., Luan, H., Sun, M., Rao, S., & Liu, S. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1082 · Cited by 657 · cited 4×
“In contrast, using multi-step relation paths (e.g., husband ( barack , michelle ) ∧ mother ( michelle , sasha ) to train KB embeddings has been proposed very recently (Guu et al., 2015; Garcia-Duran et al., 2015; Lin et al., 2015; Neelakantan et al., 2015).”
MethodInfluentialIncorporating Vector Space Similarity in Random Walk Inference over Knowledge Bases
Gardner, M., Talukdar, P., Krishnamurthy, J., & Mitchell, T. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1044 · Cited by 189
Literome: PubMed-scale genomic knowledge base in the cloud
Poon, H., Quirk, C., DeZiel, C., & Heckerman, D. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btu383 · Cited by 73 · cited 2×
“A set of 333 words often associated with regulation events in Literome (e.g. induce , inhibit , reduce , suppress ) were used as trigger words.”
MethodSelf-citation
Cited by
Modeling Relational Data with Graph Convolutional Networks
Schlichtkrull, M., Kipf, T. N., Bloem, P., van den Berg, R., Titov, I., & Welling, M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-93417-4_38 · Cited by 5,570
Knowledge Graph Embedding: A Survey of Approaches and Applications
Wang, Q., Mao, Z., Wang, B., & Guo, L. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2754499 · Cited by 2,654
“, entity types [25], [26], relation paths [27], [28], [29], textual descriptions [30], [31], [32], [33], and even logical rules [23], [34], [35], to learn more pre-”
BackgroundMethodA 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
A Novel Embedding Model for Knowledge Base Completion Based on Convolutional Neural Network
Nguyen, D. Q., Nguyen, T. D., Nguyen, D. Q., & Phung, D. (2018) · Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers) · doi:10.18653/v1/n18-2053 · Cited by 923
Variational Reasoning for Question Answering With Knowledge Graph
Zhang, Y., Dai, H., Kozareva, Z., Smola, A., & Song, L. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.12057 · Cited by 462
Metadata
- Authors
- Toutanova, K., Lin, V., Yih, W.-T., Poon, H., & Quirk, C.
- Venue
- Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
- Published
- 2016
- Pages
- 1434-1444
- OpenAlex
- W2460319482
- Cited by
- 138
- References
- 8
- FWCI
- 14.70
- Type
- conference paper
- Language
- en
- Open access
- hybrid
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Compositional Learning of Embeddings for Relation Paths in Knowledge Base and Text. https://app.cochat.ai/papers/10.18653/v1/p16-1136
- The paper
- Toutanova, K., Lin, V., Yih, W.-T., Poon, H., & Quirk, C. (2016). Compositional Learning of Embeddings for Relation Paths in Knowledge Base and Text. Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). https://doi.org/10.18653/v1/p16-1136
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.