Low-rank multi-view subspace clustering via adaptive weight

Multi-view subspace clustering, which aims to partition a set of multi-source data into a common space, has recently attracted wide attention in the field of data analysis and machine learning. Traditional algorithms may face the problem of high complexity in calculating the self-expression matrix and in turning parameter. This paper proposes a novel multi-view subspace clustering model termed as Low-rank Multi-view Subspace Clustering via Adaptive Weight (LMSCAW). LMSCAW decomposes the self-expression matrix into the product of two low-rank representation matrices and thus can fix the rank of the self-expression matrix of each view to increase the stability of the algorithm. In addition, in order to learn the common representation matrix better, LMSCAW fuses the self-expression matrices among multiple views and implicitly weights each view by the Frobenius norm without additional parameters. Extensive experimental results on multiple benchmark datasets are provided to show the effectiveness of the proposed algorithm and its superior performance over other state-of-the-art methods.