Meta-path infomax joint structure enhancement for multiplex network representation learning

被引:1
作者
Yuan, Ruiwen [1 ,2 ]
Wu, Yajing [2 ]
Tang, Yongqiang [2 ]
Wang, Junping [1 ,2 ]
Zhang, Wensheng [1 ,2 ]
机构
[1] Univ Chinese Acad Sci, Sch Artificial Intelligence, Beijing, Peoples R China
[2] Chinese Acad Sci, Inst Automat, State Key Lab Multimodal Artificial Intelligence S, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Multiplex network; Graph neural network; Network representation learning; Complementary information; Graph structure learning; NEURAL-NETWORKS; GRAPH;
D O I
10.1016/j.knosys.2023.110701
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Network representation learning has achieved significant success in homogeneous network data analysis in recent years. Nevertheless, they cannot be directly applied in multiplex networks. To overcome the characteristic of heterogeneity in multiplex networks, several emerging methods utilize the concept of meta-path to denote different types of relations and obtain the node representations for each type of meta-path individually. Despite the remarkable progress, there still exist two important issues in the previous approaches. First, the complementary information between different types of meta-paths that may make the representations more discriminative, is rarely investigated. Second, current studies generally learn multiplex node representations based on the original graph structure, while overlooking the latent relations between nodes. To address the aforementioned issues, in this paper, we propose a novel model with Meta-path Infomax joint Structure Enhancement (MISE) for multiplex network representations. Specifically, we first develop a meta-path infomax mechanism, which maximizes the mutual information between local and global meta-path representations, making the node representation contain more complementary information. Additionally, we propose a graph structure learning module that captures the implicit correlations between nodes to construct the latent graph structure. Such structure enhancement is a simple yet surprisingly effective technique to learn high-quality representations. We sufficiently evaluate the performance of our proposal on both supervised and unsupervised downstream tasks. Comprehensive experimental results show that our MISE achieves a promising boost in performance on a variety of real-world datasets for multiplex network representation learning.& COPY; 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:14
相关论文
共 63 条
[1]  
[Anonymous], 2014, 2 INT C LEARNING REP
[2]   Multi-aspect self-supervised learning for heterogeneous information network [J].
Che, Feihu ;
Tao, Jianhua ;
Yang, Guohua ;
Liu, Tong ;
Zhang, Dawei .
KNOWLEDGE-BASED SYSTEMS, 2021, 233
[3]  
Chen Yu, 2020, Advances in Neural Information Processing Systems, V33
[4]   Cross-Network Embedding for Multi-Network Alignment [J].
Chu, Xiaokai ;
Fan, Xinxin ;
Yao, Di ;
Zhu, Zhihua ;
Huang, Jianhui ;
Bi, Jingping .
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, :273-284
[5]  
Defferrard M, 2016, ADV NEUR IN, V29
[6]  
Fedus W., 2019, PROC 7 INT C LEARN R
[7]   Graph Representation Learning via Hard and Channel-Wise Attention Networks [J].
Gao, Hongyang ;
Ji, Shuiwang .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :741-749
[8]  
Gao X., 2020, PROC IEEE INT C MULT, P1
[9]   Graph embedding techniques, applications, and performance: A survey [J].
Goyal, Palash ;
Ferrara, Emilio .
KNOWLEDGE-BASED SYSTEMS, 2018, 151 :78-94
[10]   node2vec: Scalable Feature Learning for Networks [J].
Grover, Aditya ;
Leskovec, Jure .
KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, :855-864