Indexed by:
Abstract:
Multi-view clustering has attractive intensive attention and proved to be more effective than single-view clustering. The mining and effective utilization of information complementarity is core of multi-view clustering. In this paper, we propose a novel Auto-Weighted Graph Regularization and Residual Compensation for Multi-view Subspace Clustering (ARMSC) method, which adopts residual representation information to compensate the globally low rank consensus representation. The auto-weighted multi-view graph regularization term is constructed to preserve the local manifold structure of multiple features, which can automatically adjust the weights and the learned weights are adopt to measure the importance of each view's residual representation for final representation. Specifically, we formulate the graph regularized consistent representation using nuclear norm and a set of group effect residual compensation using Frobenius norm. Finally, we introduce a convex relaxation and alternating direction method to optimize the problem. Comprehensive and ablation experiments on seven real-world data sets illustrate the effectiveness and superiority of the proposed ARMSC over several state-of-the-art multi-view clustering approaches.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
NEURAL PROCESSING LETTERS
ISSN: 1370-4621
Year: 2022
Issue: 5
Volume: 54
Page: 3851-3871
3 . 1
JCR@2022
2 . 6 0 0
JCR@2023
ESI Discipline: COMPUTER SCIENCE;
ESI HC Threshold:61
JCR Journal Grade:3
CAS Journal Grade:4
Cited Count:
WoS CC Cited Count: 2
SCOPUS Cited Count: 3
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: