Search

In recent years, multi-view clustering has been widely concerned and studied. Being its data generally has high dimension and noise, how to effectively deal with redundant features in data from various views and improve the clustering effect is an important issue in multi-view clustering. In this paper, a robust multi-view clustering algorithm Multi-view K -means clustering algorithm based on redundant and sparse feature learning (RSFMVKM) considering redundancy and sparse feature learning is proposed, which can effectively reduce the dimensions of data from different views. Firstly, the K -means algorithm is extended to multi-view clustering, and the importance of each views is represented by learning the weight of each view. Secondly, the sparse feature representation is obtained by applying the norm constraint to the projection matrix in a single view, and the cosine similarity is used to depict the redundancy matrix, which can remove the redundant information and improve the clustering effect. Moreover, the proposed algorithm can effectively avoid the generation of empty classes, and the clustering index matrix is discrete, so the clustering results can be obtained directly. Finally, the proposed algorithm is compared with six state-of-the-art multi-view clustering algorithms on six public datasets, and the experimental results show that the algorithm is effective. • By feature learning, the dimensionality of data is effectively reduced and redundant features are removed. • Control the importance of each view by learning weights. • Using the coordinate descent method, the clustering results can be obtained directly and no empty class is generated. [ABSTRACT FROM AUTHOR]