.png){kind=icon}
.png){kind=icon}
Return
Multi-view clustering with interactive mechanism
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2021.03.065.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Existing multi-view clustering methods either seek to directly learn a consistent spectral embedding, or to learn a consistent graph. This work presents a novel model, called Multi-view Clustering with Interactive Mechanism (MCIM). Using the interactive mechanism, the uniform graph and spectral embedding can be learned alternatively and promote to each other. Furthermore, we perform spectral embedding learning on Grassmann manifold via an implicitly weighted-learning scheme and reveal the clustering result via graph learning. To solve the proposed model, we propose an efficient optimiza-tion method and provide the corresponding convergence analysis. The experimental results on real image datasets demonstrate the superiorities of MCIM compared to several SOTA methods. (c) 2021 Elsevier B.V. All rights reserved.
Keywords:
Multi-view learning
Image clustering
Grassmann manifold
Spectral embedding
Cauchy loss function
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W