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 条
  • [1] Aggarwal CC, 2010, ADV DATABASE SYST, V40, P1, DOI 10.1007/978-1-4419-6045-0
  • [2] Anandkumar A., 2013, ARXIV
  • [3] [Anonymous], 2016, P 25 INT JOINT C ART
  • [4] Identifying Influential and Susceptible Members of Social Networks
    Aral, Sinan
    Walker, Dylan
    [J]. SCIENCE, 2012, 337 (6092) : 337 - 341
  • [5] Motif-based communities in complex networks
    Arenas, A.
    Fernandez, A.
    Fortunato, S.
    Gomez, S.
    [J]. JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2008, 41 (22)
  • [6] Emergence of scaling in random networks
    Barabási, AL
    Albert, R
    [J]. SCIENCE, 1999, 286 (5439) : 509 - 512
  • [7] Higher-order organization of complex networks
    Benson, Austin R.
    Gleich, David F.
    Leskovec, Jure
    [J]. SCIENCE, 2016, 353 (6295) : 163 - 166
  • [8] Fast unfolding of communities in large networks
    Blondel, Vincent D.
    Guillaume, Jean-Loup
    Lambiotte, Renaud
    Lefebvre, Etienne
    [J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
  • [9] Graph Regularized Nonnegative Matrix Factorization for Data Representation
    Cai, Deng
    He, Xiaofei
    Han, Jiawei
    Huang, Thomas S.
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) : 1548 - 1560
  • [10] Non-negative Matrix Factorization on Manifold
    Cai, Deng
    He, Xiaofei
    Wu, Xiaoyun
    Han, Jiawei
    [J]. ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2008, : 63 - +