Collaborative contrastive learning for hypergraph node classification

被引:19
作者
Wu, Hanrui [1 ,5 ]
Li, Nuosi [1 ]
Zhang, Jia [1 ,5 ]
Chen, Sentao [2 ]
Ng, Michael K. [3 ]
Long, Jinyi [1 ,4 ,5 ]
机构
[1] Jinan Univ, Guangzhou, Peoples R China
[2] Shantou Univ, Shantou, Peoples R China
[3] Hong Kong Baptist Univ, Hong Kong, Peoples R China
[4] Guangdong Key Lab Tradit Chinese Med Informat Tech, Guangzhou, Peoples R China
[5] Pazhou Lab, Guangzhou, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Hypergraph; Hypergraph convolution; Contrastive learning; Graph convolution; Node classification; GRAPH CONVOLUTIONAL NETWORKS;
D O I
10.1016/j.patcog.2023.109995
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Plenty of models have been presented to handle the hypergraph node classification. However, very few of these methods consider contrastive learning, which is popular due to its great power to represent instances. This paper makes an attempt to leverage contrastive learning to hypergraph representation learning. Specifically, we propose a novel method called Collaborative Contrastive Learning (CCL), which incorporates a generated standard graph with the hypergraph. The main technical contribution here is that we develop a collaborative contrastive schema, which performs contrast between the node views obtained from the standard graph and hypergraph in each network layer, thus making the contrast collaborative. To be precise, in the first layer, the view from the standard graph is used to augment that from the hypergraph. Then, in the next layer, the augmented features are adopted to train a new representation to augment the view from the standard graph conversely. With this setting, the learning procedure is alternated between the standard graph and hypergraph. As a result, the learning on the standard graph and hypergraph is collaborative and leads to the final informative node representation. Experimental results on several widely used datasets validate the effectiveness of the proposed model.
引用
收藏
页数:9
相关论文
共 49 条
[1]  
Arya D, 2020, Arxiv, DOI arXiv:2010.04558
[2]   Contrastive Learning for Unsupervised Video Highlight Detection [J].
Badamdorj, Taivanbat ;
Rochan, Mrigank ;
Wang, Yang ;
Cheng, Li .
2022 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2022, :14022-14032
[3]   Learning Graph Convolutional Networks Based on Quantum Vertex Information Propagation [J].
Bai, Lu ;
Jiao, Yuhang ;
Cui, Lixin ;
Rossi, Luca ;
Wang, Yue ;
Yu, Philip S. ;
Hancock, Edwin R. .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (02) :1747-1760
[4]   Learning Backtrackless Aligned-Spatial Graph Convolutional Networks for Graph Classification [J].
Bai, Lu ;
Cui, Lixin ;
Jiao, Yuhang ;
Rossi, Luca ;
Hancock, Edwin R. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2022, 44 (02) :783-798
[5]   Hypergraph convolution and hypergraph attention [J].
Bai, Song ;
Zhang, Feihu ;
Torr, Philip H. S. .
PATTERN RECOGNITION, 2021, 110
[6]  
Bhattacharya I., 2007, ACM Tezas. Knowl Discon. Data, V1, P5, DOI DOI 10.1145/1217299.1217304
[7]  
Cai DR, 2022, Data Min, P127
[8]  
Cai DR, 2022, PROCEEDINGS OF THE THIRTY-FIRST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2022, P1923
[9]  
Cao HN, 2021, FINDINGS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, EMNLP 2021, P4867
[10]  
Dong Y., 2020, GRAPH REPR WORKSH IN