Return
Self-Supervised Deep Multiview Spectral Clustering
DOI:10.1109/TNNLS.2022.3195780.png)
Abstract
En 中文
Multiview spectral clustering has received considerable attention in the past decades and still has great potential due to its unsupervised integration manner. It is well known that pairwise constraints boost the clustering process to a great extent. Nevertheless, the constraints are usually marked by human beings. To ameliorate the performance of multiview spectral clustering and alleviate the consumption of human resources, we propose self-supervised multiview spectral clustering with a small number of automatically retrieved pairwise constraints. First, the fused multiple autoencoders are used to extract the latent consistent feature of multiple views. Second, the pairwise constraints are achieved based on the commonality among multiple views. Then, the pairwise constraints are propagated through the neural network with historical memory. Finally, the propagated constraints are used to optimize the fused affinity matrix of spectral clustering. Our experiments on four benchmark datasets show the effectiveness of our proposed approach.
Keywords:
Feature extraction
Clustering algorithms
Task analysis
Data mining
Software
Decoding
Matrix decomposition
Constraint propagation network
deep multiview
self-supervised
spectral clustering
Journal
IF:
8.9
Papers:
7.5K
Citations:
7.2W

