Simple Multigraph Convolution Networks
Authors: 
Danyang Wu, Xinjie Shen, Jitao Lu, Jin Xu, Feiping NieAuthors Info & Claims
Pages 794 - 797
Abstract
Existing multigraph convolution methods either ignore the cross-view interaction among multiple graphs, or induce extremely high computational cost due to standard cross-view polynomial operators. To alleviate this problem, this paper proposes a Simple MultiGraph Convolution Networks (SMGCN) which first extracts consistent cross-view topology from multigraphs including edge-level and subgraph-level topology, then performs polynomial expansion based on raw multigraphs and consistent topologies. In theory, SMGCN utilizes the consistent topologies in polynomial expansion rather than standard cross-view polynomial expansion, which performs credible cross-view spatial message-passing, follows the spectral convolution paradigm, and effectively reduces the complexity of standard polynomial expansion. In the simulations, experimental results demonstrate that SMGCN achieves state-of-the-art performance on ACM and DBLP multigraph benchmark datasets. Our codes are available at https://github.com/frinkleko/SMGCN.
Supplemental Material
MP4 File
Supplemental video
- Download
- 69.83 MB
References
[1]
Tapas Bhadra, Saurav Mallik, and Sanghamitra Bandyopadhyay. 2019. Identification of Multiview Gene Modules Using Mutual Information-Based Hypograph Mining. IEEE Transactions on Systems, Man, and Cybernetics: Systems, Vol. 49, 6 (June 2019), 1119--1130.
[2]
Landon Butler, Alejandro Parada-Mayorga, and Alejandro Ribeiro. 2023. Convolutional Learning on Multigraphs. IEEE Transactions on Signal Processing, Vol. 71 (2023), 933--946.
[3]
Wanqiu Cui, Junping Du, Dawei Wang, Feifei Kou, and Zhe Xue. 2021. MVGAN: Multi-View Graph Attention Network for Social Event Detection. ACM Transactions on Intelligent Systems and Technology, Vol. 12, 3 (June 2021), 1--24.
[4]
Shaohua Fan, Xiao Wang, Chuan Shi, Emiao Lu, Ken Lin, and Bai Wang. 2020. One2Multi Graph Autoencoder for Multi-view Graph Clustering. In Proceedings of The Web Conference 2020. ACM.
[5]
Matthias Fey and Jan E. Lenssen. 2019. Fast Graph Representation Learning with PyTorch Geometric. In ICLR Workshop on Representation Learning on Graphs and Manifolds.
[6]
Xinyu Fu, Jiani Zhang, Ziqiao Meng, and Irwin King. 2020. MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding. In Proceedings of The Web Conference 2020. ACM.
[7]
Qi Li, Wenping Chen, Zhaoxi Fang, Changtian Ying, and Chen Wang. 2023. A multi-view contrastive learning for heterogeneous network embedding. Scientific Reports, Vol. 13, 1 (April 2023).
[8]
Qingsong Lv, Ming Ding, Qiang Liu, Yuxiang Chen, Wenzheng Feng, Siming He, Chang Zhou, Jianguo Jiang, Yuxiao Dong, and Jie Tang. 2021. Are we really making much progress?. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery Data Mining. ACM.
[9]
Meng Qu, Jian Tang, Jingbo Shang, Xiang Ren, Ming Zhang, and Jiawei Han. 2017. An Attention-based Collaboration Framework for Multi-View Network Representation Learning. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. ACM.
[10]
Liat Sless, Noam Hazon, Sarit Kraus, and Michael Wooldridge. 2018. Forming k coalitions and facilitating relationships in social networks. Artificial Intelligence, Vol. 259 (June 2018), 217--245.
[11]
Duo Wang, Mateja Jamnik, and Pietro Lio. 2020. Abstract Diagrammatic Reasoning with Multiplex Graph Networks.
[12]
Ke Yan, Xiaozhao Fang, Yong Xu, and Bin Liu. 2019. Protein fold recognition based on multi-view modeling. Bioinformatics, Vol. 35, 17 (Jan. 2019), 2982--2990.
[13]
Ding Zou, Wei Wei, Xian-Ling Mao, Ziyang Wang, Minghui Qiu, Feida Zhu, and Xin Cao. 2022. Multi-level Cross-view Contrastive Learning for Knowledge-aware Recommender System. In Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM. io
Index Terms
- Simple Multigraph Convolution Networks
Recommendations
Augmenting a (k - 1)-Vertex-Connected Multigraph ℓ-Edge-Connected and k-Vertex-Connected Multigraph
For two integers $k,\ell > 0$ and an undirected multigraph $G=(V,E)$, we consider the problem of augmenting $G$ by the smallest number of new edges to obtain an $\ell$-edge-connected and $k$-vertex-connected multigraph. In this paper we show that a $(k-...
A simple algorithm for triconnectivity of a multigraph
CATS '09: Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94Vertex-connectivity and edge-connectivity represent the extent to which a graph is connected. Study of these key properties of graphs plays an important role in varieties of computer science applications. Recent years have witnessed a number of linear ...
Inequalities on the Number of Connected Spanning Subgraphs in a Multigraph
Consider an undirected multigraph G = ( V,E ) with n vertices and m edges, and let N i denote the number of connected spanning subgraphs with i ( m ≥ i ≥ n ) edges in G . Recently, we showed in [3] the validity of ( m - i + 1) N i -1 > ( i-n + ⌊3+√9+...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
May 2024
1928 pages
ISBN:9798400701726
DOI:10.1145/3589335
- General Chairs:
- Tat-Seng Chua,
- Chong-Wah Ngo,
- Program Chairs:
- Ravi Kumar,
- Hady W. Lauw,
- Roy Ka-Wei Lee
Copyright © 2024 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 May 2024
Check for updates
Author Tags
Qualifiers
- Short-paper
Conference
WWW '24
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,899 of 8,196 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 60Total Downloads
- Downloads (Last 12 months)60
- Downloads (Last 6 weeks)5
Reflects downloads up to 19 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in