Knowledge Graph Embedding: A Survey from the Perspective of Representation Spaces
November 07, 2022 Β· The Cartographer Β· π ACM Computing Surveys
"No code URL or promise found in abstract"
"Title-pattern auto-detect: Knowledge Graph Embedding: A Survey from the Perspective of Representation Spaces"
Evidence collected by the PWNC Scanner
Authors
Jiahang Cao, Jinyuan Fang, Zaiqiao Meng, Shangsong Liang
arXiv ID
2211.03536
Category
cs.LG: Machine Learning
Cross-listed
cs.AI,
cs.CL,
cs.IR
Citations
140
Venue
ACM Computing Surveys
Last Checked
1 day ago
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 paper, 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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Machine Learning
ποΈ
ποΈ
Transcended
ποΈ
ποΈ
Transcended
Continuous control with deep reinforcement learning
π
π
Old Age
Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
π
π
Old Age
Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor
π
π
Old Age
SGDR: Stochastic Gradient Descent with Warm Restarts
ποΈ
ποΈ
Transcended