ACTIVE:Augmentation-Free Graph Contrastive Learning for Partial Multi-View Clustering
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose an augmentation-free graph contrastive learning framework, namely ACTIVE, to solve the problem of partial multi-view clustering. Notably, we suppose that the representations of similar samples (i.e., belonging to the same cluster) and their multiply views features should be similar. This is distinct from the general unsupervised contrastive learning that assumes an image and its augmentations share a similar representation. Specifically, relation graphs are constructed using the nearest neighbours to identify existing similar samples, then the constructed inter-instance relation graphs are transferred to the missing views to build graphs on the corresponding missing data. Subsequently, two main components, within-view graph contrastive learning (WGC) and cross-view graph consistency learning (CGC), are devised to maximize the mutual information of different views within a cluster. The proposed approach elevates instance-level contrastive learning and missing data inference to the cluster-level, effectively mitigating the impact of individual missing data on clustering. Experiments on several challenging datasets demonstrate the superiority of our proposed methods.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 6 of its 31 references that are in the map. First posted on arXiv 1 Mar 2022.
Builds on
6 of 31 references.
References · 6
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
- 2020Deep Partial Multi-View Learningcited by 71
- 2019Doubly Aligned Incomplete Multi-view Clusteringcited by 40
- 2020Generative Partial Multi-View Clusteringcited by 25
- 2019Spectral Perturbation Meets Incomplete Multi-view Datacited by 24
- 2019Shared Generative Latent Representation Learning for Multi-view Clusteringcited by 17
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.
- 2025Incomplete Graph Learning: A Comprehensive Survey18 Feb 2025
- 2023Self-supervised Multi-view Clustering in Computer Vision: A Survey18 Sep 2023