.png){kind=icon}
.png){kind=icon}
Return
Multi-view Spectral Clustering with Adaptive Graph Learning and Tensor Schatten p-norm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2021.09.052.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Although the promising clustering performance, existing graph-based multi-view clustering methods still have the following deficiencies. (1) They cannot well exploit the salient difference between graphs of dif-ferent views, resulting in suboptimal graphs. (2) They minimize the divergence between graphs of different views by one-dimensional, element by element metric model. Thus, they cannot well exploit the comple-mentary information embedded in graphs. (3) They fail to simultaneously take local and global intrinsic geometric structures into account, resulting in suboptimal clustering performance. To handle the afore-mentioned problems, we propose Multi-view Spectral Clustering with Adaptive Graph Learning and Tensor Schatten p-norm. Specifically, we present an adaptive weighted strategy that directly takes into account the contribution among different views for clustering. To well learn a good graph, which well char-acterizes cluster structure, we integrate local and global structure learning into a unified framework and leverage tensor Schatten p-norm regularizer to minimize the divergence between graphs of different views. Extensive experiments on benchmark datasets have demonstrated the superiority of the proposed method. (c) 2021 Elsevier B.V. All rights reserved.
Keywords:
Unsupervised learning
Multi-view spectral clustering
Graph learning
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W