Partial Multi-view Clustering Based on StarGAN and Subspace Learning

The traditional multi-view clustering method assumes that the data of each view is complete. However, there is a lack of data in some views in real life, and thus leads to the problem of partial multi-view clustering. Most of the existing partial multi-view clustering methods are based on kernel matrix and non-negative matrix decomposition, and most of them are just learning a common clustering structure, rather than making full use of the existing data information to infer the missing data. Based on StarGAN and subspace learning, a partial multi-view clustering algorithm(SSPMVC)was proposed in this study. SSPMVC makes full use of the existing data information to generate the missing data with the generation model based on StarGAN, captures the integrity and consistency global structure of the data, and then clusters the completed multi-view data in the subspace. The generation model and clustering model were trained jointly by SSPMVC, and the generation model and clustering model were alternately optimized. The experimental results show that the algorithm proposed in this paper is superior to the classical multi-view clustering method. © 2020, Editorial Department, Journal of South China University of Technology. All right reserved.