.png){kind=icon}
.png){kind=icon}
Return
Semisupervised Progressive Representation Learning for Deep Multiview Clustering
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2023.3278379.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multiview clustering has become a research hotspot in recent years due to its excellent capability of heterogeneous data fusion. Although a great deal of related works has appeared one after another, most of them generally overlook the potentials of prior knowledge utilization and progressive sample learning, resulting in unsatisfactory clustering performance in real-world applications. To deal with the aforementioned drawbacks, in this article, we propose a semisupervised progressive representation learning approach for deep multiview clustering (namely, SPDMC). Specifically, to make full use of the discriminative information contained in prior knowledge, we design a flexible and unified regularization, which models the sample pairwise relationship by enforcing the learned view-specific representation of must-link (ML) samples (cannot-link (CL) samples) to be similar (dissimilar) with cosine similarity. Moreover, we introduce the self-paced learning (SPL) paradigm and take good care of two characteristics in terms of both complexity and diversity when progressively learning multiview representations, such that the complementarity across multiple views can be squeezed thoroughly. Through comprehensive experiments on eight widely used image datasets, we prove that the proposed approach can perform better than the state-of-the-art opponents.
Keywords:
Representation learning
Training
Data models
Task analysis
Complexity theory
Semisupervised learning
Optimization
Deep clustering
multiview clustering
progressive sample learning
semisupervised learning
Journal
IF:
8.9
Papers:
7.5K
Citations:
7.2W
View more organizations