Anchor Graph Network for Incomplete Multiview Clustering

• Published in: IEEE transaction on neural networks and learning systems Vol. PP; pp. 1 - 12
• Main Authors: Fu, Yulu, Li, Yuting, Huang, Qiong, Cui, Jinrong, Wen, Jie
• Format: Journal Article
• Language: English
• Published: United States 12.01.2024
• ISSN: 2162-237X; 2162-2388
• DOI: 10.1109/TNNLS.2024.3349405

Incomplete multiview clustering (IMVC) has received extensive attention in recent years. However, existing works still have several shortcomings: 1) some works ignore the correlation of sample pairs in the global structural distribution; 2) many methods are computational expensive, thus cannot be applicable to the large-scale incomplete data clustering tasks; and 3) some methods ignore the refinement of the bipartite graph structure. To address the above issues, we propose a novel anchor graph network for IMVC, which includes a generative model and a similarity metric network. Concretely, the method uses a generative model to construct bipartite graphs, which can mine latent global structure distributions of sample pairs. Later, we use graph convolution network (GCN) with the constructed bipartite graphs to learn the structural embeddings. Notably, the introduction of bipartite graphs can greatly reduce the computational complexity and thus enable our model to handle large-scale data. Unlike previous works based on bipartite graph, our method employs bipartite graphs to guide the learning process in GCNs. In addition, an innovative adaptive learning strategy that can construct robust bipartite graphs is incorporated into our method. Extensive experiments demonstrate that our method achieves the comparable or superior performance compared with the state-of-the-art methods.