.png){kind=icon}
.png){kind=icon}
Return
Multi-view clustering based on generalized low rank approximation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2020.08.049.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The core of most existing graph-based multi-view clustering methods is to learn a rigid consistent spectral embedding from multiple graphs. In practice, however, such a consistency over spectral embedding may be rigorous to limit the final clustering result, since the quality and structure of different graphs are generally different. To this end, we propose to learn a relaxed consistent spectral embedding via a generalized low rank approximation model. Particularly, the proposed model introduces an adaptively weighted system which can further improve the robustness of algorithm by assigning a specific weight for each view. For the involved objective function is non-convex and non-smooth, a Relaxed MM (Majorization-Minimization) approach is developed to solve it. And, we show that Relaxed MM can reduce the computation complexity from O(n(3)), required by most existing graph-based methods, to O(nc(2)), where c and n are the number of clusters and samples, respectively, and c << n. Numerical experiments performed on real world data demonstrate that our algorithm generally achieves comparable or better clustering results compared to eight state-of-the-art multi-view clustering methods. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Clustering
Multi-view
Sparse
Spectral clustering
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