Multi-view subspace clustering via simultaneously learning the representation tensor and affinity matrix

• Published in: Pattern recognition Vol. 106; p. 107441
• Main Authors: Chen, Yongyong, Xiao, Xiaolin, Zhou, Yicong
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.10.2020
• Subjects: Adaptive weights; Local manifold; Low-rank tensor representation; Multi-view subspace clustering; Tensor-singular value decomposition; Local manifold; Tensor-singular value decomposition; Adaptive weights; Low-rank tensor representation; Multi-view subspace clustering
• ISSN: 0031-3203; 1873-5142
• DOI: 10.1016/j.patcog.2020.107441

•A novel multi-view subspace clustering method (GLTA) is proposed.•GLTA adopts the tensor nuclear norm to explore high-order correlation among multiple features.•GLTA exploited the manifold regularization to preserve the view-specific geometrical structures.•GLTA can automatically assign a optimal weight for each view.•Extensive experiments on seven real-world datasets are given for validation. Multi-view subspace clustering aims at separating data points into multiple underlying subspaces according to their multi-view features. Existing low-rank tensor representation-based multi-view subspace clustering algorithms are robust to noise and can preserve the high-order correlations of multi-view features. However, they may suffer from two common problems: (1) the local structures and different importance of each view feature are often neglected; (2) the low-rank representation tensor and affinity matrix are learned separately. To address these issues, we propose a unified framework to learn the Graph regularized Low-rank representation Tensor and Affinity matrix (GLTA) for multi-view subspace clustering. In the proposed GLTA framework, the tensor singular value decomposition-based tensor nuclear norm is adopted to explore the high-order cross-view correlations. The manifold regularization is exploited to preserve the local structures embedded in high-dimensional space. The importance of different features is automatically measured when constructing the final affinity matrix. An iterative algorithm is developed to solve GLTA using the alternating direction method of multipliers. Extensive experiments on seven challenging datasets demonstrate the superiority of GLTA over the state-of-the-art methods.