电信科学 ›› 2024, Vol. 40 ›› Issue (3): 89-103.doi: 10.11959/j.issn.1000-0801.2024070

• 研究与开发 • 上一篇    

基于元路径卷积的异构图神经网络算法

秦志龙1,2, 邓琨1,3, 刘星妍1   

  1. 1 嘉兴大学信息科学与工程学院,浙江 嘉兴 314001
    2 浙江理工大学计算机科学与技术学院(人工智能学院),浙江 杭州 310018
    3 嘉兴大学浙江省全省多模态感知与智能系统重点实验室,浙江 嘉兴 314001
  • 修回日期:2024-03-15 出版日期:2024-03-01 发布日期:2024-03-01
  • 作者简介:秦志龙(1999- ),男,浙江理工大学计算机科学与技术学院(人工智能学院)硕士生,主要研究方向为异构图神经网络和深度学习等
    邓琨(1980- ),男,博士,嘉兴大学浙江省全省多模态感知与智能系统重点实验室、嘉兴大学信息科学与工程学院副教授、硕士生导师,主要研究方向为网络结构分析、数据挖掘、异构网络分析等
    刘星妍(1980- ),女,嘉兴大学信息科学与工程学院高级工程师,主要研究方向为数据挖掘、网络结构分析等
  • 基金资助:
    教育部人文社会科学研究专项任务项目(22JDSZ3023);教育部产学合作协同育人项目(220603372015422);教育部产学合作协同育人项目(220604029012441)

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)

摘要:

现有异构图嵌入方法在多层图卷积计算中,通常将每个节点表示为单个向量,使得高阶图卷积层无法区分不同关系和顺序的信息,导致信息在传递过程中丢失。为解决该问题,提出了基于元路径卷积的异构图神经网络算法。该方法首先利用特征转换自适应调整节点特征;其次,设计了元路径内卷积挖掘节点高阶间接关系,捕获目标节点在单元路径下与其他类型节点之间的交互关系;最后,通过自注意力机制探索语义之间的相互性,融合来自不同元路径的特征。在ACM、IMDB和DBLP数据集上进行广泛实验,并与当前主流算法进行对比分析。实验结果显示,节点分类任务中Macro-F1平均提高0.5%~3.5%,节点聚类任务中ARI值提高了1%~3%,证明该算法是有效、可行的。

关键词: 异构图, 图嵌入, 图神经网络, 元路径, 图卷积

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

中图分类号: 

No Suggested Reading articles found!