Contrastive Ensemble Clustering

被引:0
作者
Chen, Man-Sheng [1 ,2 ,3 ]
Lin, Jia-Qi [4 ]
Wang, Chang-Dong [1 ,2 ,3 ]
Huang, Dong [5 ]
Lai, Jian-Huang [6 ,7 ]
机构
[1] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou 510275, Peoples R China
[2] Sun Yat Sen Univ, Guangdong Key Lab Big Data Anal & Proc, Guangzhou 510275, Peoples R China
[3] Guangxi Zhuang Autonomous Reg Informat Ctr, Guangxi Key Lab Digital Infrastructure, Nanning 530201, Peoples R China
[4] Sun Yat Sen Univ, Sch Math Zhuhai, Guangzhou 510275, Peoples R China
[5] South China Univ, Dept Comp Sci, Guangzhou 510640, Peoples R China
[6] Sun Yat sen Univ, Sch Comp Sci & Engn, Guangdong Key Lab Informat Secur Technol, Minist Educ, Guangzhou 510275, Peoples R China
[7] Sun Yat sen Univ, Key Lab Machine Intelligence & Adv Comp, Minist Educ, Guangzhou 510275, Peoples R China
关键词
Clustering methods; Clustering algorithms; Noise measurement; Contrastive learning; Representation learning; Partitioning algorithms; Noise; Mutual information; Loss measurement; Data structures; Adaptive fusion; contrastive components; ensemble clustering; latent representation;
D O I
10.1109/TNNLS.2025.3531903
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Ensemble clustering aims to combine different base clusterings into a better clustering than that of the individual one. In general, a co-association matrix depicting the pairwise affinity between different data samples is constructed by average fusion or weighted fusion of the connective matrices from multiple base clusterings. Despite the significant success, the existing works fail to capture the global structure information from multiple noisy connective matrices. Meanwhile, the locality property of the resulting representation matrix could not be explicitly preserved. In this article, we propose a novel contrastive ensemble clustering (CEC) method. Specifically, a consensus mapping model is designed for the discovery of the latent representation from the noisy observations with distinct confidences. Furthermore, a contrastive regularizer is dexterously formulated to refine the latent representation while preserving its locality property. Extensive experiments conducted on several benchmark datasets demonstrate the superiority of the proposed CEC method. To the best of our knowledge, it is the first time to explore the potential of latent representation learning and contrastive components for the ensemble clustering task.
引用
收藏
页数:13
相关论文
共 64 条
  • [1] Chao GQ, 2024, AAAI CONF ARTIF INTE, P11221
  • [2] Adaptively-weighted Integral Space for Fast Multiview Clustering
    Chen, Man-Sheng
    Liu, Tuo
    Wang, Chang-Dong
    Huang, Dong
    Lai, Jian-Huang
    [J]. PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA, MM 2022, 2022, : 3774 - 3782
  • [3] Chen T, 2020, PR MACH LEARN RES, V119
  • [4] Fair Labeled Clustering
    Esmaeili, Seyed A.
    Duppala, Sharmila
    Dickerson, John P.
    Brubach, Brian
    [J]. PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, : 327 - 335
  • [5] One2Multi Graph Autoencoder for Multi-view Graph Clustering
    Fan, Shaohua
    Wang, Xiao
    Shi, Chuan
    Lu, Emiao
    Lin, Ken
    Wang, Bai
    [J]. WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020), 2020, : 3070 - 3076
  • [6] Fern X. Z., 2004, ACM International Conference Proceeding Series, V69, DOI [10.1145/1015330.1015414, DOI 10.1145/1015330.1015414]
  • [7] Combining multiple clusterings using evidence accumulation
    Fred, ALN
    Jain, AK
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2005, 27 (06) : 835 - 850
  • [8] Gutmann M., 2010, P 13 INT C ART INT S, P297, DOI DOI 10.1145/3292500.3330651
  • [9] Hadsell R., 2006, 2006 IEEE COMP VIS P, V2, P1735, DOI DOI 10.1109/CVPR.2006.100
  • [10] Ensemble Clustering With Attentional Representation
    Hao, Zhezheng
    Lu, Zhoumin
    Li, Guoxu
    Nie, Feiping
    Wang, Rong
    Li, Xuelong
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2024, 36 (02) : 581 - 593