Self-Supervised Deep Multiview Spectral Clustering

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transaction on neural networks and learning systems Jg. 35; H. 3; S. 1 - 10
Hauptverfasser: Zong, Linlin, Miao, Faqiang, Zhang, Xianchao, Liang, Wenxin, Xu, Bo
Format: Journal Article
Sprache:Englisch
Veröffentlicht: United States IEEE 01.03.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Clustering
Clustering algorithms
Commonality
Constraint propagation network
Data mining
Decoding
deep multiview
Feature extraction
Matrix decomposition
Neural networks
self-supervised
Software
spectral clustering
Task analysis
ISSN:2162-237X, 2162-2388, 2162-2388
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2162-237X
2162-2388
2162-2388
DOI:10.1109/TNNLS.2022.3195780