HMSG: Heterogeneous graph neural network based on Metapath SubGraph learning

被引:17
作者
Guan, Mengya [1 ,2 ]
Cai, Xinjun [1 ,2 ]
Shang, Jiaxing [1 ,2 ]
Hao, Fei [3 ]
Liu, Dajiang [1 ,2 ]
Jiao, Xianlong [1 ,2 ]
Ni, Wancheng [4 ,5 ]
机构
[1] Chongqing Univ, Coll Comp Sci, Chongqing, Peoples R China
[2] Chongqing Univ, Key Lab Dependable Serv Comp Cyber Phys Soc, Minist Educ, Chongqing, Peoples R China
[3] Shaanxi Normal Univ, Sch Comp Sci, Xian, Peoples R China
[4] Chinese Acad Sci, Inst Automat, Beijing, Peoples R China
[5] Univ Chinese Acad Sci, Beijing, Peoples R China
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
Graph neural network; Heterogeneous graph; Metapath; Subgraph; Information network; MAXIMIZATION;
D O I
10.1016/j.knosys.2023.110930
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Heterogeneous graph neural network (HGNN) models, capable of learning low-dimensional dense vectors from heterogeneous graphs for downstream graph-mining tasks, have attracted increasing attention in recent years. For these models, metapath-based methods have been widely adopted. However, most existing metapath-based HGNN models either discard intermediate nodes within a metapath, resulting in information loss, or indiscriminately aggregate information along a metapath containing different types of nodes, resulting in unavoidable learning bias. To overcome these limitations, a new HGNN model named HMSG, is proposed in this paper to comprehensively capture structural, semantic and attribute information from both homogeneous and heterogeneous neighbors more purposefully. To achieve this, a type-specific linear transformation is first applied to transfer the node attributes to different types of nodes with the same latent factor space. In the new model, the heterogeneous graph is decomposed into multiple metapath-based homogeneous and heterogeneous subgraphs where each subgraph associates specific semantic and structural information; this is different from existing models, which mainly rely on symmetric metapaths. Subsequently, tailored attention-based message aggregation methods are independently applied to each subgraph such that information learning can be more targeted. Finally, information from different subgraphs is fused through graph-level attention to obtain a complete representation. The learned representations are evaluated by several graph-mining tasks. Results indicate that the HMSG attains the best performance in all evaluation metrics than state-of-the-art baselines. Further ablation experiments demonstrate the effectiveness of the modules designed for the HMSG. (c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:11
相关论文
共 62 条
[61]  
Zhang MH, 2018, ADV NEUR IN, V31
[62]   Few-shot Heterogeneous Graph Learning via Cross-domain Knowledge Transfer [J].
Zhang, Qiannan ;
Wu, Xiaodong ;
Yang, Qiang ;
Zhang, Chuxu ;
Zhang, Xiangliang .
PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, :2450-2460