HDMI: High-order Deep Multiplex Infomax
Baoyu Jing, Chanyoung Park, Hanghang Tong
Abstract
Networks have been widely used to represent the relations between objects such as academic networks and social networks, and learning embedding for networks has thus garnered plenty of research attention. Self-supervised network representation learning aims at extracting node embedding without external supervision. Recently, maximizing the mutual information between the local node embedding and the global summary (e.g. Deep Graph Infomax, or DGI for short) has shown promising results on many downstream tasks such as node classification. However, there are two major limitations of DGI. Firstly, DGI merely considers the extrinsic supervision signal (i.e., the mutual information between node embedding and global summary) while ignores the intrinsic signal (i.e., the mutual dependence between node embedding and node attributes). Secondly, nodes in a real-world network are usually connected by multiple edges with different relations, while DGI does not fully explore the various relations among nodes. To address the above-mentioned problems, we propose a novel framework, called High-order Deep Multiplex Infomax (HDMI), for learning node embedding on multiplex networks in a self-supervised way. To be more specific, we first design a joint supervision signal containing both extrinsic and intrinsic mutual information by high-order mutual information, and we propose a High-order Deep Infomax (HDI) to optimize the proposed supervision signal. Then we propose an attention based fusion module to combine node embedding from different layers of the multiplex network. Finally, we evaluate the proposed HDMI on various downstream tasks such as unsupervised clustering and supervised classification. The experimental results show that HDMI achieves state-of-the-art performance on these tasks. CCS CONCEPTS • Computing methodologies → Neural networks; Learning latent representations; • Mathematics of computing → Information theory; Graph algorithms.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers44
- Augmentation-Free Self-Supervised Learning on GraphsNamkyeong Lee, Junseok Lee, Chanyoung ParkAAAI 2022 · 288 citations
- GraphGPT: Graph Instruction Tuning for Large Language ModelsJiabin Tang, Yuhao Yang, Wei Wei, Lei Shi et al.SIGIR 2024 · 182 citations
- Simple Unsupervised Graph Representation LearningYujie Mo, Liang Peng, Jie Xu, Xiaoshuang Shi et al.AAAI 2022 · 166 citations
- Multiplex Heterogeneous Graph Convolutional NetworkPengyang Yu, Chaofan Fu, Yanwei Yu, Chao Huang et al.KDD 2022 · 90 citations
- Graph Communal Contrastive LearningBolian Li, Baoyu Jing, Hanghang TongWWW 2022 · 77 citations
Builds on4
- Graph Representation Learning via Graphical Mutual Information MaximizationZhen Peng, Wenbing Huang, Minnan Luo, Qinghua Zheng et al.WWW 2020 · 682 citations
- Unsupervised Attributed Multiplex Network EmbeddingChanyoung Park, Donghyun Kim, Jiawei Han, Hwanjo YuAAAI 2020 · 333 citations
- Dynamic Knowledge Graph AlignmentYuchen Yan, Lihui Liu, Yikun Ban, Baoyu Jing et al.AAAI 2021 · 100 citations
- Network of Tensor Time SeriesBaoyu Jing, Hanghang Tong, Yada ZhuWWW 2021 · 48 citations
Related papers
- Deep Graph Structural InfomaxWenting Zhao, Gongping Xu, Zhen Cui, Siqiang Luo et al.AAAI 2023 · 18 citations
- Semi-Supervised Embedding of Attributed Multiplex NetworksYlli Sadikaj, Justus Rass, Yllka Velaj, Claudia PlantWWW 2023 · 8 citations
- Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social RecommendationJunliang Yu, Hongzhi Yin, Jundong Li, Qinyong Wang et al.WWW 2021 · 598 citations
- Self-Supervised Graph Neural Networks via Diverse and Interactive Message PassingLiang Yang, Cheng Chen, Weixun Li, Bingxin Niu et al.AAAI 2022 · 13 citations
- Semi-Supervised Deep Learning for Multiplex NetworksAnasua Mitra, Priyesh Vijayan, Sanasam Ranbir Singh, Diganta Goswami et al.KDD 2021 · 19 citations
