摘要

Multi-view clustering algorithms have shown promising performance in various applications over the last few decades. Most of them, however, do not adequately take noises and correlation among multiple views into account, which may degrade the clustering performance. In this paper, we propose a novel multi-view clustering method to address these issues. In specific, we construct a low-rank consensus matrix and a sparse error matrix from each similarity matrix corresponding to each view. Furthermore, a matrix-induced regularization term is incorporated to reduce the redundancy and enhance the diversity among different views. The augmented Lagrangian multiplier algorithm is adopted to solve the resultant optimization problem. Comprehensive experiments are conducted to verify the effectiveness of the proposed algorithm. Results demonstrate that our algorithm outperforms several state-of-the-art ones on both synthetic and benchmark data sets.