On Multi-Relational Link Prediction with Bilinear Models
Open accessAbstract
We study bilinear embedding models for the task of multi-relational link prediction and knowledge graph completion. Bilinear models belong to the most basic models for this task, they are comparably efficient to train and use, and they can provide good prediction performance. The main goal of this paper is to explore the expressiveness of and the connections between various bilinear models proposed in the literature. In particular, a substantial number of models can be represented as bilinear models with certain additional constraints enforced on the embeddings. We explore whether or not these constraints lead to universal models, which can in principle represent every set of relations, and whether or not there are subsumption relationships between various models. We report results of an independent experimental study that evaluates recent bilinear models in a common experimental setup. Finally, we provide evidence that relation-level ensembles of multiple bilinear models can achieve state-of-the-art prediction performance.
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
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?
TransE is not fully expressive.
“Wang et al. [44] prove that TransE is not fully expressive.”
From SimplE Embedding for Link Prediction in Knowledge Graphs (2018) · cites this paper as [44]
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
Complex Embeddings for Simple Link Prediction
Trouillon, T., Welbl, J., Riedel, S., Gaussier, É., & Bouchard, G. (2016) · arXiv · doi:10.48550/arxiv.1606.06357 · Cited by 2,100 · see citing works
Flagged first, then by citations
Research works printed but not linked: 31
- - 1985 Alon, N.; Frankl, P.; and Rödl, V. 1985. Geometrical realization of set systems and probabilistic communication complexity. In FOCS , 277-280. IEEE Computer Society.
- - 2016 Alon, N.; Moran, S.; and Yehudayoff, A. 2016. Sign rank versus vc dimension. In COLT , 47-80.
- - 2008 Bollacker, K. D.; Evans, C.; Paritosh, P.; Sturge, T.; and Taylor, J. 2008. Freebase: a collaboratively created graph database for structuring human knowledge. In SIGMOD , 1247-1250. ACM.
- - 2013 Bordes, A.; Usunier, N.; García-Durán, A.; Weston, J.; and Yakhnenko, O. 2013. Translating embeddings for modeling multi-relational data. In NIPS , 2787-2795.
- - 2014 Bordes, A.; Glorot, X.; Weston, J.; and Bengio, Y. 2014. A semantic matching energy function for learning with multi-relational data - application to word-sense disambiguation. Machine Learning 94(2):233-259.
- - 1970 Carroll, J. D., and Chang, J.-J. 1970. Analysis of individual differences in multidimensional scaling via an n-way generalization of 'eckart-young' decomposition. Psychometrika 35(3):283-319.
- - 2014 Dong, X.; Gabrilovich, E.; Heitz, G.; Horn, W.; Lao, N.; Murphy, K.; Strohmann, T.; Sun, S.; and Zhang, W. 2014. Knowledge vault: a web-scale approach to probabilistic knowledge fusion. In KDD , 601-610. ACM.
- - 2011 Duchi, J. C.; Hazan, E.; and Singer, Y. 2011. Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research 12:21212159.
- - 2011 Han, J.; Kamber, M.; and Pei, J. 2011. Data Mining: Concepts and Techniques, 3rd edition . Morgan Kaufmann.
- - 2017 Hayashi, K., and Shimbo, M. 2017. On the equivalence of holographic and complex embeddings for link prediction. In ACL (2) , 554-559. Association for Computational Linguistics.
- - 2015 Krompaß, D., and Tresp, V. 2015. Ensemble solutions for link-prediction in knowledge graphs. In 2nd Workshop on Linked Data for Knowledge Discovery .
- - 2015 Lehmann, J.; Isele, R.; Jakob, M.; Jentzsch, A.; Kontokostas, D.; Mendes, P. N.; Hellmann, S.; Morsey, M.; van Kleef, P.; Auer, S.; and Bizer, C. 2015. Dbpedia A large-scale, multilingual knowledge base extracted from wikipedia. Semantic Web 6(2):167-195.
- - 2015a Lin, Y.; Liu, Z.; Luan, H.; Sun, M.; Rao, S.; and Liu, S. 2015a. Modeling relation paths for representation learning of knowledge bases. In EMNLP , 705-714. Association for Computational Linguistics.
- - 2015b Lin, Y.; Liu, Z.; Sun, M.; Liu, Y.; and Zhu, X. 2015b. Learning entity and relation embeddings for knowledge graph completion. In AAAI , 2181-2187. AAAI Press.
- - 2017 Liu, H.; Wu, Y.; and Yang, Y. 2017. Analogical inference for multi-relational embeddings. In ICML , volume 70, 2168-2178. PMLR.
- - 2013 Mikolov, T.; Chen, K.; Corrado, G.; and Dean, J. 2013. Efficient estimation of word representations in vector space. CoRR abs/1301.3781. · arXiv
- - 1995 Miller, G. A. 1995. Wordnet: A lexical database for english. Communications of the ACM 38(11):39-41.
- - 2016 Neumann, S.; Gemulla, R.; and Miettinen, P. 2016. What you will gain by rounding: Theory and algorithms for rounding rank. In ICDM , 380-389. IEEE Computer Society.
- - 2016 Nickel, M.; Murphy, K.; Tresp, V.; and Gabrilovich, E. 2016. A review of relational machine learning for knowledge graphs. IEEE Computer Society 104(1):11-33.
- - 2014 Nickel, M.; Jiang, X.; and Tresp, V. 2014. Reducing the rank of relational factorization models by including observable patterns. In NIPS , 1179-1187.
- - 2016 Nickel, M.; Rosasco, L.; and Poggio, T. A. 2016. Holographic embeddings of knowledge graphs. In AAAI , 19551961. AAAI Press.
- - 2011 Nickel, M.; Tresp, V.; and Kriegel, H. 2011. A threeway model for collective learning on multi-relational data. In ICML , 809-816. Omnipress.
- - 2016 Niepert, M. 2016. Discriminative gaifman models. In NIPS , 3405-3413.
- - 2013 Riedel, S.; Yao, L.; McCallum, A.; and Marlin, B. M. 2013. Relation extraction with matrix factorization and universal schemas. In HLT-NAACL , 74-84. Association for Computational Linguistics.
- - 2017 Schlichtkrull, M. S.; Kipf, T. N.; Bloem, P.; van den Berg, R.; Titov, I.; and Welling, M. 2017. Modeling relational data with graph convolutional networks. CoRR abs/1703.06103. · arXiv
- - 2013 Socher, R.; Chen, D.; Manning, C. D.; and Ng, A. Y. 2013. Reasoning with neural tensor networks for knowledge base completion. In NIPS , 926-934.
- - 2017 Trouillon, T., and Nickel, M. 2017. Complex and holographic embeddings of knowledge graphs: A comparison. CoRR abs/1707.01475. · arXiv
- - 2016b Trouillon, T.; Dance, C. R.; Gaussier, E.; and Bouchard, G. 2016b. Decomposing real square matrices via unitary diagonalization. CoRR .
- - 2014 Wang, Z.; Zhang, J.; Feng, J.; and Chen, Z. 2014. Knowledge graph embedding by translating on hyperplanes. In AAAI , 1112-1119. AAAI Press.
- - 2015 Xiao, H.; Huang, M.; Hao, Y.; and Zhu, X. 2015. Transg : A generative mixture model for knowledge graph embedding. CoRR abs/1509.05488. · arXiv
- - 2014 Yang, B.; Yih, W.; He, X.; Gao, J.; and Deng, L. 2014. Embedding entities and relations for learning and inference in knowledge bases. CoRR abs/1412.6575. · arXiv
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 · see citing works
SimplE Embedding for Link Prediction in Knowledge Graphs
Kazemi, S. M., & Poole, D. (2018) · arXiv · doi:10.48550/arxiv.1802.04868 · Cited by 476 · see citing works
- Authors
- Wang, Y., Gemulla, R., & Li, H.
- Affiliations
- University of Mannheim (DE)
- University of Hong Kong (HK)
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2018-04-29
- Volume
- 32
- Issue
- 1
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2754811377
- Cited by
- 65
- References
- 1
- Citations by year
- 2025: 5 · 2024: 5 · 2023: 3 · 2022: 9 · 2021: 17 · 2020: 9 · 2019: 13 · 2018: 3 · 2017: 1
- FWCI
- 4.27
- Type
- conference paper
- Language
- en
- Open access
- diamond
- doi.org
- Locations
- Proceedings of the AAAI Conference on Artificial Intelligence (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) (submittedVersion)
- MADOC (University of Mannheim) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
- Keywords
- knowledge graph completion, model expressiveness, universal model
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
