Incomplete Multi-View Clustering With Complete View Guidance

被引:4
|
作者
Chen, Zhikui [1 ,2 ]
Li, Yue [1 ,2 ]
Lou, Kai [1 ,2 ]
Zhao, Liang [1 ,2 ]
机构
[1] Dalian Univ Technol, Sch Software Technol, Dalian 116620, Peoples R China
[2] Dalian Univ Technol, Serv Software Liaoning Prov, Key Lab Ubiquitous Network, Dalian 116620, Peoples R China
基金
中国国家自然科学基金;
关键词
Data models; Mathematical models; Transformers; Brain modeling; Training; Software; Signal processing; Incomplete multi-view clustering; distillation learning; contrastive learning;
D O I
10.1109/LSP.2023.3302234
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In recent years, multi-view clustering has gained widespread attention in signal processing because multi-view data contains more information than a single view. However, multi-view data is often incomplete due to missing data in one or more random views. Therefore, several methods have been proposed for incomplete multi-view clustering to learn features that contain consensus information for clustering incomplete multi-view data (IMD). However, there is a part of the IMD that is not missing in any view, and most previous methods have not utilized this part to guide the process of learning consensus information. To address this issue, we design a knowledge distillation framework for incomplete multi-view clustering and propose an incomplete multi-view clustering with complete view guidance (IMC-CVG). We first train a robust teacher model with contrastive learning loss on the complete part of IMD to learn consensus features containing multi-view information. Then, we train a student model on all the IMD, where we mask partial views of the complete data to simulate missing data, and utilize the teacher model to guide the student model to learn consensus features that contain as much multi-view information as possible. Experiments show that our proposed method outperforms all the compared state-of-the-art methods.
引用
收藏
页码:1247 / 1251
页数:5
相关论文
共 50 条
  • [1] Consensus Learning with Complete Graph Regularization for Incomplete Multi-view Clustering
    Zhang, Jie
    Fei, Lunke
    Teng, Shaohua
    Zhu, Qinghua
    Imad, Rida
    Wen, Jie
    2022 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2022, : 1485 - 1492
  • [2] Prototype Matching Learning for Incomplete Multi-View Clustering
    Yuan, Honglin
    Sun, Yuan
    Zhou, Fei
    Wen, Jing
    Yuan, Shihua
    You, Xiaojian
    Ren, Zhenwen
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2025, 34 : 828 - 841
  • [3] Localized Sparse Incomplete Multi-View Clustering
    Liu, Chengliang
    Wu, Zhihao
    Wen, Jie
    Xu, Yong
    Huang, Chao
    IEEE TRANSACTIONS ON MULTIMEDIA, 2023, 25 : 5539 - 5551
  • [4] Incomplete multi-view clustering based on hypergraph
    Chen, Jin
    Xu, Huafu
    Xue, Jingjing
    Gao, Quanxue
    Deng, Cheng
    Lv, Ziyu
    INFORMATION FUSION, 2025, 117
  • [5] Cross-view graph matching for incomplete multi-view clustering
    Yang, Jing-Hua
    Fu, Le-Le
    Chen, Chuan
    Dai, Hong-Ning
    Zheng, Zibin
    NEUROCOMPUTING, 2023, 515 : 79 - 88
  • [6] Unifying complete and incomplete multi-view clustering through an information-theoretic generative model
    Zheng, Yanghang
    Zhou, Guoxu
    Huang, Haonan
    Luo, Xintao
    Huang, Zhenhao
    Zhao, Qibin
    NEURAL NETWORKS, 2025, 182
  • [7] Deep spectral clustering network for incomplete multi-view clustering
    Li, Ao
    Mei, Sanlin
    Feng, Cong
    Gao, Tianyu
    Huang, Hai
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2025, 148
  • [8] Consensus guided incomplete multi-view spectral clustering
    Wen, Jie
    Sun, Huijie
    Fei, Lunke
    Li, Jinxing
    Zhang, Zheng
    Zhang, Bob
    NEURAL NETWORKS, 2021, 133 : 207 - 219
  • [9] Auto-Weighted Incomplete Multi-View Clustering
    Deng, Wanyu
    Liu, Lixia
    Li, Jianqiang
    Lin, Yijun
    IEEE ACCESS, 2020, 8 : 138752 - 138762
  • [10] Local structure learning for incomplete multi-view clustering
    Wang, Yongchun
    Yang, Youlong
    Ning, Tong
    APPLIED INTELLIGENCE, 2024, 54 (04) : 3308 - 3324