Knowledge Graph Embedding: A Survey from the Perspective of Representation Spaces
Open accessThe DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Abstract
Knowledge graph embedding (KGE) is an increasingly popular technique that aims to represent entities and relations of knowledge graphs into low-dimensional semantic spaces for a wide spectrum of applications such as link prediction, knowledge reasoning and knowledge completion. In this article, we provide a systematic review of existing KGE techniques based on representation spaces. Particularly, we build a fine-grained classification to categorise the models based on three mathematical perspectives of the representation spaces: (1) algebraic perspective, (2) geometric perspective and (3) analytical perspective. We introduce the rigorous definitions of fundamental mathematical spaces before diving into KGE models and their mathematical properties. We further discuss different KGE methods over the three categories, as well as summarise how spatial advantages work over different embedding needs. By collating the experimental results from downstream tasks, we also explore the advantages of mathematical space in different scenarios and the reasons behind them. We further state some promising research directions from a representation space perspective, with which we hope to inspire researchers to design their KGE models as well as their related applications with more consideration of their mathematical space properties.
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
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2018) · arXiv · doi:10.48550/arxiv.1810.04805 · Cited by 73,173
Learning Phrase Representations using RNN Encoder–Decoder for Statistical Machine Translation
Cho, K., van Merrienboer, B., Gulcehre, C., Bahdanau, D., Bougares, F., Schwenk, H., & Bengio, Y. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1179 · Cited by 25,545
Language Models are Few-Shot Learners
Brown, T. B., Mann, B., Ryder, N., Subbiah, M., Kaplan, J., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al. (2020) · arXiv · doi:10.48550/arxiv.2005.14165 · Cited by 23,372
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
Survey of Hallucination in Natural Language Generation
Ji, Z., Lee, N., Frieske, R., Yu, T., Su, D., Xu, Y., Ishii, E., Bang, Y. J., Madotto, A., & Fung, P. (2023) · ACM Computing Surveys · doi:10.1145/3571730 · Cited by 5,025 · cited 1×
“Despite their success in many applications, LLMs still suffer from the following shortcomings: (1) They are known to suffer from the hallucination issue [7, 78], i.”
BackgroundFreebase: 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
LLaMA: Open and Efficient Foundation Language Models
Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.-A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., et al. (2023) · arXiv · doi:10.48550/arxiv.2302.13971 · Cited by 4,602
Knowledge Graph Embedding by Translating on Hyperplanes
Wang, Z., Zhang, J., Feng, J., & Chen, Z. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8870 · Cited by 3,915 · cited 14×
“Within high-dimensional conditions, both non-Euclidean and Euclidean models exhibit comparable performance in representing KGs. preliminarily infer that, by measured by the average scores metric (i.e., the Avg_score ), Euclidean Therefore, (1) .”
BackgroundMethodInfluentialLearning Entity and Relation Embeddings for Knowledge Graph Completion
Lin, Y., Liu, Z., Sun, M., Liu, Y., & Zhu, X. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9491 · Cited by 3,749 · cited 10×
“Within high-dimensional conditions, both non-Euclidean and Euclidean models exhibit comparable performance in representing KGs. preliminarily infer that, by measured by the average scores metric (i.e., the Avg_score ), Euclidean Therefore, (1) .”
BackgroundInfluentialA 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
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 · cited 2×
“[181] classify KGE methods based on their embedding functions and categorise them into three folds: translation-based models, semantic matching models and additional information-based models.”
BackgroundMethodConvolutional 2D Knowledge Graph Embeddings
Dettmers, T., Minervini, P., Stenetorp, P., & Riedel, S. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11573 · Cited by 2,486
Embedding 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 7×
“SE [15] AAAI 2011 Euclidean O(d2) O(Ned + Nrd(2)) RESCAL [130] ICML 2011 Euclidean O(d2) O(Ned + Nrd(2)) TransE [14] NeurIPS 2013 Euclidean O(d) O(Ned + Nrd) TransH [190] AAAI 2014 Euclidean O(d) O(Ned + Nrd) TransR [109] AAAI 2015 Euclidean O(dk) O(Ned + Nrdk) TransD [75] ACL-IJCNLP 2015 Euclidean O(max(d, k)) O(Ned…”
BackgroundMethodInfluentialLanguage Models as Knowledge Bases?
Petroni, F., Rocktäschel, T., Riedel, S., Lewis, P., Bakhtin, A., Wu, Y., & Miller, A. (2019) · Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) · doi:10.18653/v1/d19-1250 · Cited by 1,834
ERNIE: Enhanced Language Representation with Informative Entities
Zhang, Z., Han, X., Liu, Z., Jiang, X., Sun, M., & Liu, Q. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1139 · Cited by 1,482 · cited 3×
“Researchers always use machine learning methods [188, 189, 232] to infer potential relations between entity pairs and identify erroneous knowledge based on existing data automatically.”
BackgroundRotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space
Sun, Z., Deng, Z.-H., Nie, J.-Y., & Tang, J. (2019) · arXiv · doi:10.48550/arxiv.1902.10197 · Cited by 1,414
Unifying Large Language Models and Knowledge Graphs: A Roadmap
Pan, S., Luo, L., Wang, Y., Chen, C., Wang, J., & Wu, X. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2024.3352100 · Cited by 1,376 · cited 3×
“Therefore, we believe KGs and KGEs are still useful in the context of LLMs since they can be complementary to LLMs, which is helpful in improving the performance and explainability of LLMs [131].”
BackgroundObserved 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
How Can We Know What Language Models Know?
Jiang, Z., Xu, F. F., Araki, J., & Neubig, G. (2020) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00324 · Cited by 1,002
Encoding Sentences with Graph Convolutional Networks for Semantic Role Labeling
Marcheggiani, D., & Titov, I. (2017) · Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d17-1159 · Cited by 907
End-to-End Structure-Aware Convolutional Networks for Knowledge Base Completion
Shang, C., Tang, Y., Huang, J., Bi, J., He, X., & Zhou, B. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33013060 · Cited by 725
Representation Learning of Knowledge Graphs with Entity Descriptions
Xie, R., Liu, Z., Jia, J., Luan, H., & Sun, M. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10329 · Cited by 725
TuckER: Tensor Factorization for Knowledge Graph Completion
Balažević, I., Allen, C., & Hospedales, T. M. (2019) · arXiv · doi:10.48550/arxiv.1901.09590 · Cited by 702
TuckER: Tensor Factorization for Knowledge Graph Completion
Balazevic, I., Allen, C., & Hospedales, T. (2019) · Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) · doi:10.18653/v1/d19-1522 · Cited by 696 · cited 1×
“Specifically, the definition of group can naturally satisfy the basic properties (e.g., inversion, composition) of knowledge graphs , which means the group-based models should have”
BackgroundBang, Y., Cahyawijaya, S., Lee, N., Dai, W., Su, D., Wilie, B., Lovenia, H., Ji, Z., Yu, T., Chung, W., et al. (2023) · Proceedings of the 13th International Joint Conference on Natural Language Processing and the 3rd Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/2023.ijcnlp-main.45 · Cited by 682 · cited 1×
“Despite their success in many applications, LLMs still suffer from the following shortcomings: (1) They are known to suffer from the hallucination issue [7, 78], i.”
BackgroundKEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representation
Wang, X., Gao, T., Zhu, Z., Zhang, Z., Liu, Z., Li, J., & Tang, J. (2021) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00360 · Cited by 676 · cited 1×
“Researchers always use machine learning methods [113, 114, 146] to infer potential relations between entity pairs and identify erroneous knowledge based on existing data automatically.”
BackgroundPoincaré Embeddings for Learning Hierarchical Representations
Nickel, M., & Kiela, D. (2017) · arXiv · doi:10.48550/arxiv.1705.08039 · Cited by 667
Modeling 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 1×
“Method Year FB15K-237 WN18RR MRR Hits@10 Hits@1 MRR Hits@10 Hits@1”
BackgroundComposition-based Multi-Relational Graph Convolutional Networks
Vashishth, S., Sanyal, S., Nitin, V., & Talukdar, P. (2019) · arXiv · doi:10.48550/arxiv.1911.03082 · Cited by 581 · cited 1×
“CompGCN [170] leverages a variety of composition operators derived from KGE methods to concurrently embed nodes and relations in a graph.”
MethodIntroduction to Topological Manifolds
Lee, J. M. (2011) · Graduate Texts in Mathematics · doi:10.1007/978-1-4419-7940-7 · Cited by 511
SimplE Embedding for Link Prediction in Knowledge Graphs
Kazemi, S. M., & Poole, D. (2018) · arXiv · doi:10.48550/arxiv.1802.04868 · Cited by 476 · cited 1×
“Specifically, the definition of group can naturally satisfy the basic properties (e.g., inversion, composition) of knowledge graphs , which means the group-based models should have”
BackgroundLow-Dimensional Hyperbolic Knowledge Graph Embeddings
Chami, I., Wolf, A., Juan, D.-C., Sala, F., Ravi, S., & Ré, C. (2020) · Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/2020.acl-main.617 · Cited by 384
(2020) · doi:10.18653/v1/2020.acl-main.91 · Cited by 214
TorusE: Knowledge Graph Embedding on a Lie Group
Ebisu, T., & Ichise, R. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11538 · Cited by 212
Multi-relational Poincaré Graph Embeddings
Balažević, I., Allen, C., & Hospedales, T. (2019) · arXiv · doi:10.48550/arxiv.1905.09791 · Cited by 123
BoxE: A Box Embedding Model for Knowledge Base Completion
Abboud, R., Ceylan, İ. İ., Lukasiewicz, T., & Salvatori, T. (2020) · arXiv · doi:10.48550/arxiv.2007.06267 · Cited by 74
Exploiting Structured Knowledge in Text via Graph-Guided Representation Learning
Shen, T., Mao, Y., He, P., Long, G., Trischler, A., & Chen, W. (2020) · Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.722 · Cited by 63
Gaur, M., Gunaratna, K., Srinivasan, V., & Jin, H. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i10.21312 · Cited by 57
Irreflexive and Hierarchical Relations as Translations
Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., & Yakhnenko, O. (2013) · arXiv · doi:10.48550/arxiv.1304.7158 · Cited by 23 · cited 1×
“(d) composition A clause with such form is a symmetry pattern.”
BackgroundChen, T., Wang, Z., Li, L., Li, D., Li, Z., Chang, X., Bian, P., Liang, G., Wang, Q., & Xie, T. (2025) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2025.6
Cited by
Devarakonda, M. V., Mohanty, S., Sunkishala, R. R., Mallampalli, N., & Liu, X. (2024) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2024.104627 · Cited by 9
Paolini, L., Vahdati, S., Di Iorio, A., Wardenga, R., Heibi, I., & Peroni, S. (2025) · Scientometrics · doi:10.1007/s11192-025-05418-8 · Cited by 8
Metadata
- Authors
- Cao, J., Fang, J., Meng, Z., & Liang, S.
- Venue
- ACM Computing Surveys
- Published
- 2024-03-13
- Volume
- 56
- Issue
- 6
- Pages
- 1-42
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W4391473819
- Cited by
- 171
- References
- 41
- FWCI
- 25.45
- 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.