Survey on Representation Learning Methods of Knowledge Graph for Link Prediction

被引:0
作者
Du X.-Y. [1 ,2 ]
Liu M.-W. [1 ,2 ]
Shen L.-W. [1 ,2 ]
Peng X. [1 ,2 ]
机构
[1] School of Computer Science, Fudan University, Shanghai
[2] Shanghai Key Laboratory of Data Science, Fudan University, Shanghai
来源
Ruan Jian Xue Bao/Journal of Software | 2024年 / 35卷 / 01期
关键词
hyper-relation; knowledge graph; link prediction; multi-relation; representation learning;
D O I
10.13328/j.cnki.jos.006902
中图分类号
学科分类号
摘要
As an important cornerstone of artificial intelligence, knowledge graphs can extract and represent a priori knowledge from massive data on the Internet, which greatly solves the bottleneck problem of the poor interpretability of cognitive decisions of intelligent systems and plays a key role in the construction and application of intelligent systems. As the application of knowledge graph technology continues to deepen, the knowledge graph completion that aims to solve the problem of the incompleteness of graphs is imminent. Link prediction is the task of predicting the missing entities and relations in the knowledge graph, which is indispensable in the construction and completion of the knowledge graph. The full exploitation of the hidden relations in the knowledge graph and the use of massive entities and relations for computation require the conversion of the symbolic representations of information into the numerical form, i.e., knowledge graph representation learning. Hence, link prediction-oriented knowledge graph representation learning has become a popular research topic in the field of knowledge graphs. This study systematically introduces the latest research progress of link prediction-oriented knowledge graph representation learning methods from the basic concepts of link prediction and representation learning. Specifically, the research progress is discussed in detail in terms of knowledge representation forms and algorithmic modeling methods. The development of the knowledge representation forms is used as a clue to introduce the mathematical modeling of link prediction tasks in the knowledge representation forms of binary relations, multi-relations, and hyper-relations. On the basis of the representation learning modeling, the existing methods are refined into four types of models: translation distance models, tensor decomposition models, traditional deep learning models, and graph neural network models. The implementation methods of each type are described in detail together with representative models for solving link prediction tasks with different relational metrics. The common datasets and criteria for link prediction are then introduced, and on this basis, the link prediction effects of the four types of knowledge representation learning models under the knowledge representation forms of binary relations, multi-relations, and hyper-relations are presented in a comparative analysis. Finally, the future development trends are given in terms of model optimization, knowledge representation forms, and problem scope. © 2024 Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码:87 / 117
页数:30
相关论文
共 104 条
[51]  
Liu HX, Wu YX, Yang YM., Analogical inference for multi-relational embeddings, Proc. of the 34th Int’l Conf. on Machine Learning, pp. 2168-2178, (2017)
[52]  
Kazemi SM, Poole D., SimplE embedding for link prediction in knowledge graphs, Proc. of the 32nd Int’l Conf. on Neural Information Processing Systems, pp. 4289-4300, (2018)
[53]  
Toutanova K, Chen DQ., Observed versus latent features for knowledge base and text inference, Proc. of the 3rd Workshop on Continuous Vector Space Models and Their Compositionality, pp. 57-66, (2015)
[54]  
Kadlec R, Bajgar O, Kleindienst J., Knowledge base completion: Baselines strike back, Proc. of the 2nd Workshop on Representation Learning for NLP, pp. 69-74, (2017)
[55]  
Nickel M, Rosasco L, Poggio T., Holographic embeddings of knowledge graphs, Proc. of the 30th AAAI Conf. on Artificial Intelligence, pp. 1955-1961, (2016)
[56]  
Hayashi K, Shimbo M., On the equivalence of holographic and complex embeddings for link prediction, Proc. of the 55th Annual Meeting of the Association for Computational Linguistics (Vol. 2: Short Papers), pp. 554-559, (2017)
[57]  
Balazevic I, Allen C, Hospedales TM., TuckER: Tensor factorization for knowledge graph completion, Proc. of the 2019 Conf. on Empirical Methods in Natural Language Processing and the 9th Int’l Joint Conf. on Natural Language Processing, pp. 5185-5194, (2019)
[58]  
Hitchcock FL., The expression of a tensor or a polyadic as a sum of products, Journal of Mathematics and Physics, 6, 1 –4, pp. 164-189, (1927)
[59]  
Socher R, Chen DQ, Manning CD, Ng AY., Reasoning with neural tensor networks for knowledge base completion, Proc. of the 27th Int’l Conf. on Neural Information Processing Systems, pp. 926-934, (2013)
[60]  
Krizhevsky A, Sutskever I, Hinton GE., ImageNet classification with deep convolutional neural networks, Proc. of the 25th Int’l Conf. on Neural Information Processing Systems, pp. 1097-1105, (2012)