Knowledge Completion Method Based on Relational Embedding with GNN

被引:0
作者
Chen, Yu [1 ,2 ]
Yin, Zhuang [1 ,2 ]
Tan, Honghong [1 ,2 ]
Lin, Xiaoli [1 ,2 ]
机构
[1] Wuhan Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan, Hubei, Peoples R China
[2] Hubei Prov Key Lab Intelligent Informat Proc & Re, Wuhan, Hubei, Peoples R China
来源
ADVANCED INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS, PT XIII, ICIC 2024 | 2024年 / 14874卷
基金
中国国家自然科学基金;
关键词
Knowledge Graph; Completion; Graph Neural Network;
D O I
10.1007/978-981-97-5618-6_5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Knowledge graph, as an effective representation of structured knowledge, plays an increasingly important role in the field of artificial intelligence. However, the incompleteness and sparsity of knowledge graphs have become a bottleneck that restricts their further application. To solve this problem, researchers have proposed some knowledge completion methods based on graph neural network (GNN), which can complete the missing information in the knowledge graph through deep learning techniques. GNN is a kind of neural network approach specialized in processing graph-structured data, which can capture the node features and edge relations in the graph, and then deeply represent the information in the graph. In the knowledge-completion task, the GNN model updates the representation of a node by aggregating its neighborhood information, thus enabling the prediction of missing relations. This paper analyzes some models such as CompGCN and SE-GNN. They have shown excellent performance on several datasets. There is also an analysis of the future development of GNN-based methods for knowledge completion.
引用
收藏
页码:49 / 58
页数:10
相关论文
共 18 条
[1]  
Cui WY, 2022, ADV NEUR IN
[2]  
Dettmers T, 2018, AAAI CONF ARTIF INTE, P1811
[3]  
Guo Diandian, 2023, 2023 26th International Conference on Computer Supported Cooperative Work in Design (CSCWD), P1226, DOI 10.1109/CSCWD57460.2023.10152788
[4]   Knowledge Graphs: A Practical Review of the Research Landscape [J].
Kejriwal, Mayank .
INFORMATION, 2022, 13 (04)
[5]  
Kok S, 2007, P 24 INT C MACHINE L, P433, DOI DOI 10.1145/1273496.1273551
[6]  
Li R, 2022, AAAI CONF ARTIF INTE, P5781
[7]   A Neighborhood Re-Ranking Model With Relation Constraint for Knowledge Graph Completion [J].
Li, Yu ;
Hu, Bojie ;
Liu, Jian ;
Chen, Yufeng ;
Xu, Jinan .
IEEE-ACM TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING, 2023, 31 :411-425
[8]  
Lin XV, 2018, 2018 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING (EMNLP 2018), P3243
[9]   Detecting Drug-Target Interactions with Feature Similarity Fusion and Molecular Graphs [J].
Lin, Xiaoli ;
Xu, Shuai ;
Liu, Xuan ;
Zhang, Xiaolong ;
Hu, Jing .
BIOLOGY-BASEL, 2022, 11 (07)
[10]   Unifying Large Language Models and Knowledge Graphs: A Roadmap [J].
Pan, Shirui ;
Luo, Linhao ;
Wang, Yufei ;
Chen, Chen ;
Wang, Jiapu ;
Wu, Xindong .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (07) :3580-3599