Telecommunications Science ›› 2024, Vol. 40 ›› Issue (3): 89-103.doi: 10.11959/j.issn.1000-0801.2024070

• Research and Development • Previous Articles    

Meta-path convolution based heterogeneous graph neural network algorithm

Zhilong QIN1,2, Kun DENG1,3, Xingyan LIU1   

  1. 1 College of Information Science and Engineering, Jiaxing University, Jiaxing 314001, China
    2 School of Computer Science and Technology (School of Artificial Intelligence), Zhejiang Sci-Tech University, Hangzhou 310018, China
    3 Provincial Key Laboratory of Multimodal Perceiving and Intelligent Systems, Jiaxing University, Jiaxing 314001, China
  • Revised:2024-03-15 Online:2024-03-01 Published:2024-03-01
  • Supported by:
    The Humanity and Social Science Research Project of Ministry of Education of China(22JDSZ3023);The Ministry of Education’s Industry-University Collaboration Education Project(220603372015422);The Ministry of Education’s Industry-University Collaboration Education Project(220604029012441)

Abstract:

In the multilayer graph convolution calculation, each node is usually represented as a single vector, which makes the high-order graph convolution layer unable to distinguish the information of different relationships and sequences, resulting in the loss of information in the transmission process.To solve this problem, a heterogeneous graph neural network algorithm based on meta-path convolution was proposed.Firstly, the feature transformation was used to adaptively adjust the node features.Secondly, the high-order indirect relationship between the nodes was mined by convolution within the meta-path to capture the interaction between the target node and other types of nodes under the element path.Finally, the reciprocity between semantics was explored through the self-attention mechanism, and the features from different meta-paths were fused.Extensive experiments were carried out on ACM, IMDB and DBLP datasets, and compared with the current mainstream algorithms.The experimental results show that the average increase of Macro-F1 in the node classification task is 0.5%~3.5%, and the ARI value in the node clustering task is increased by 1%~3%, which proves that the algorithm is effective and feasible.

Key words: heterogeneous graph, graph embedding, graph neural network, meta-path, graph convolution

CLC Number: 

No Suggested Reading articles found!