One step multi-view spectral clustering via joint adaptive graph learning and matrix factorization

Multi-view clustering based on graph learning has attracted extensive attention due to its simplicity and efficiency in recent years. However, there are still some issues in most of the existing graph-based multi-view clustering methods. First, most of those methods require post-processing such as K-means or spectral rotation to get the final discrete clustering result. Second, graph-based clustering methods perform clustering on a fixed input similarity graph, which could induce bad clustering results if the initial graph is with low quality. Third, these methods have high computation cost, which hinders them for dealing with large-scale data. In order to solve these problems, we propose a multi-view spectral clustering method via joint Adaptive Graph Learning and Matrix Factorization (AGLMF). In this method, to reduce computational cost, we adopt the anchor-based strategy to construct the input similarity graphs. Then, we use the l1-norm to learn a high quality similarity graph adaptively from original similarity graphs which can make the final graph more robust than original ones. In addition, AGLMF uses symmetric non-negative matrix factorization to learn the final clustering indicators which can show the final consistent clustering result directly. Finally, experimental results on multiple multi-view datasets validate the effectiveness of the proposed algorithm when compared with previous multi-view spectral clustering algorithms. The demo code of this work is publicly available at https://github.com/theywq/AGLMF.git.