arrow
Return

Deep Contrastive Multi-View Subspace Clustering With Representation and Cluster Interactive Learning

delete2025-01-01
delete0
PRE
AI
Y
Yi Jiang
G
Guoqing Chao *
D
Dianhui Chu
DOI:10.1109/TKDE.2024.3484161delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Multi-view clustering is an important approach to mining the valuable information within multi-view data. In this paper, we propose a novel multi-view deep subspace clustering method based on contrastive learning and Cauchy-Schwarz (CS) divergence. Our method not only uses contrastive learning techniques and block diagonalization constraints to guide representation matrix learning, but also combines representation learning and clustering processes to achieve the interaction of representation and clustering. First, we introduce a novel loss function based on CS divergence in the clustering module to achieve the interaction of representation and clustering. Second, we propose an extension of the multiple positive and negative pair diffusion method to enhance contrastive learning. Finally, we establish the equivalence between contrastive clustering and spectral clustering with orthogonal constraints, leading to a comprehensive model optimization. We evaluate our method on six publicly available datasets and compare its performance with eight competing methods. The results demonstrate the superiority of our method over the compared multi-view clustering methods.
Keywords:
Contrastive learning
deep clustering
multi-view
subspace clustering
deep clustering
multi-view
subspace clustering

Journal

IEEE Transactions on Knowledge and Data Engineering cover
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
Papers:
6.8K
Citations:
3.2W

Organization

H
harbin institute of technology
Scholars:
8.0W
Papers: 6.6W
Citations: 66