Multi-view Subspace Clustering with Complex Noise Modeling

Abstract

Multi-view data clustering often aims to utilize various representations or views of original data to improve the clustering performance compared to the single-view clustering approach. Most multi-view subspace clustering methods are proposed to construct the affinity matrix of each view individually and then implement with spectral clustering for multi-view data clustering. The multi-view low-rank sparse subspace clustering (MLRSSC) is an effective and popular clustering algorithm among multi-view subspace clustering. This method can explore the joint subspace representation through creating an affinity matrix integrated of all views of input data. In addition, the low-rank and sparsity constraints are introduced into this method to enhance the clustering results. However, the original MLRSSC uses the mean square error as the fidelity term while not consider the complex noise pollution in real situations. Therefore, we introduce a complex noise modeling approach, i.e., independent and piecewise identically distributed (IPID) noise model, for MLRSSC to improve its performance. The related experimental results confirm that this proposed algorithm surpasses many state-of-the-art subspace clustering methods on several real-world datasets.