Essential multi-view graph learning for clustering

Multi-view clustering utilizes information from diverse views to improve the performance of clustering. For most existing multi-view spectral clustering methods, information of different views is integrated by pursuing a consensus similarity matrix for clustering. However, view-specific structures, which contain the complementary information of multi-view data, may be lost during the clustering process. Actually, in multi-view spectral clustering, similarity matrices of multiple views would have the same clustering structures or properties rather than be numerically uniform. To overcome the aforementioned problem, a novel essential multi-view graph learning (EMGL) method for clustering is proposed in this paper. Different from most existing multi-view spectral clustering, an orthogonal matrix factorization is imposed on multi-view similarity matrices for making them have the same nuclear norm, which indicates the same clustering structures of different views. Furthermore, we also propose an alternating direction method of multipliers (ADMM) based optimization algorithm to address the objective function of our method. Extensive experiments on several datasets demonstrate the superior performance of our proposed method.