Journal of South China University of Technology(Natural Science Edition) ›› 2022, Vol. 50 ›› Issue (12): 13-19.doi: 10.12141/j.issn.1000-565X.220384

Special Issue: 2022年计算机科学与技术

• Computer Science & Technology • Previous Articles     Next Articles

Knowledge Graph Completion Method Based on Interactively Connected Graph Attention Network

LU YiqinPAN Zhoushuang1 ZHANG Yang2 QIN Jiancheng1 HUANG Fang1   

  1. 1.School of Electronic and Information Engineering,South China University of Technology,Guangzhou 510640,Guangdong,China
    2.School of Computer Science and Engineering,South China University of Technology,Guangzhou 510006,Guangdong,China
  • Received:2022-06-17 Online:2022-12-25 Published:2022-08-12
  • Contact: 陆以勤(1968-),男,教授,博士生导师,主要从事知识图谱、深度学习、网络安全研究。 E-mail:eeyqlu@scut.edu.cn
  • About author:陆以勤(1968-),男,教授,博士生导师,主要从事知识图谱、深度学习、网络安全研究。
  • Supported by:
    the Key-Area R&D Project of Guangdong Province(2019010137001)

Abstract:

Knowledge graph provides underlying support for many intelligent information service applications, including intelligent search, public safety, finance, medical care and other fields. However, the existing knowledge graph is usually incomplete, and knowledge graph completion has become an urgent problem to be solved. The existing knowledge graph completion method models ignore the important information rich in neighbor nodes and relationships, and often simply splice neighbor nodes and relationships together, ignoring the different importance of different relationships and neighbor nodes to nodes. To solve this problem, this paper proposed a knowledge graph completion method (ICGAT) based on the interactive connection graph attention network. The method firstly finds out the potential relationship by finding two-hop neighbor nodes, and expands the triples of each node. Then it fuses the relationship in each triplet with the features of the node, and adopts the method of interactive connection between nodes and neighbor nodes, using 4 space vectors to represent the interactively connected relationship. Finally, the vector of interactive connection was input into the graph attention network to obtain the weight of relations and neighbor nodes to the node, so as to illustrate its importance. In order to effectively represent triples of complex relationships such as one-to-many, many-to-many, etc., this method used the RotatE model as a pre-training model. The experimental results in the link prediction task show that the performance of the mean rank and HR@10indicators of the ICGAT method in the WN18RR and FB15k-237 datasets have been improved to a certain extent, indicating that ICGAT can improve the accuracy of the link prediction task.

Key words: knowledge graph, graph attention network, graph neural network, interactive connectivity

CLC Number: