Motif-Based Contrastive Learning for Community Detection

被引:5
作者
Wu, Xunxun [1 ,2 ,3 ]
Wang, Chang-Dong [1 ,2 ,3 ]
Lin, Jia-Qi [4 ]
Xi, Wu-Dong [5 ]
Yu, Philip S. [6 ]
机构
[1] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou 510006, Peoples R China
[2] Minist Educ, Key Lab Machine Intelligence & Adv Comp, Guangzhou, Peoples R China
[3] Guangdong Prov Key Lab Intellectual Property & Big, Guangzhou, Peoples R China
[4] Sun Yat Sen Univ, Sch Math Zhuhai, Zhuhai 519082, Peoples R China
[5] NetEase Games, UX Ctr, Guangzhou 510665, Peoples R China
[6] Univ Illinois, Dept Comp Sci, Chicago, IL USA
关键词
Image edge detection; Self-supervised learning; Complex networks; Deep learning; Matrix decomposition; Computer science; Tensors; Community detection; complex network; contrastive learning; motif; NETWORK MOTIFS;
D O I
10.1109/TNNLS.2024.3367873
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Community detection has become a prominent task in complex network analysis. However, most of the existing methods for community detection only focus on the lower order structure at the level of individual nodes and edges and ignore the higher order connectivity patterns that characterize the fundamental building blocks within the network. In recent years, researchers have shown interest in motifs and their role in network analysis. However, most of the existing higher order approaches are based on shallow methods, failing to capture the intricate nonlinear relationships between nodes. In order to better fuse higher order and lower order structural information, a novel deep learning framework called motif-based contrastive learning for community detection (MotifCC) is proposed. First, a higher order network is constructed based on motifs. Subnetworks are then obtained by removing isolated nodes, addressing the fragmentation issue in the higher order network. Next, the concept of contrastive learning is applied to effectively fuse various kinds of information from nodes, edges, and higher order and lower order structures. This aims to maximize the similarity of corresponding node information, while distinguishing different nodes and different communities. Finally, based on the community structure of subnetworks, the community labels of all nodes are obtained by using the idea of label propagation. Extensive experiments on real-world datasets validate the effectiveness of MotifCC.
引用
收藏
页码:11706 / 11719
页数:14
相关论文
共 64 条
  • [11] On the Permanence of Vertices in Network Communities
    Chakraborty, Tanmoy
    Srinivasan, Sriram
    Ganguly, Niloy
    Mukherjee, Animesh
    Bhowmick, Sanjukta
    [J]. PROCEEDINGS OF THE 20TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'14), 2014, : 1396 - 1405
  • [12] Deep MinCut: Learning Node Embeddings by Detecting Communities
    Duong, Chi Thang
    Nguyen, Thanh Tam
    Hoang, Trung-Dung
    Yin, Hongzhi
    Weidlich, Matthias
    Nguyen, Quoc Viet Hung
    [J]. PATTERN RECOGNITION, 2022, 134
  • [13] Magnetic eigenmaps for community detection in directed networks
    Fanuel, Michael
    Alaiz, Carlos M.
    Suykens, Johan A. K.
    [J]. PHYSICAL REVIEW E, 2017, 95 (02)
  • [14] 20 years of network community detection
    Fortunato, Santo
    Newman, Mark E. J.
    [J]. NATURE PHYSICS, 2022, 18 (08) : 848 - 850
  • [15] Clustering by passing messages between data points
    Frey, Brendan J.
    Dueck, Delbert
    [J]. SCIENCE, 2007, 315 (5814) : 972 - 976
  • [16] Community Detection via Autoencoder-Like Nonnegative Tensor Decomposition
    Guan, Jiewen
    Chen, Bilian
    Huang, Xin
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2024, 35 (03) : 4179 - 4191
  • [17] Hamilton WL, 2017, ADV NEUR IN, V30
  • [18] Hassani K, 2020, PR MACH LEARN RES, V119
  • [19] He DX, 2015, AAAI CONF ARTIF INTE, P130
  • [20] Huang L, 2019, AAAI CONF ARTIF INTE, P9945