Contrastive Mean-Shift Learning for Generalized Category Discovery
원문 초록
We address the problem of generalized category discovery (GCD) that aims to partition a partially labeled collection of images; only a small part of the collection is labeled and the total number of target classes is unknown. To address this generalized image clustering problem, we revisit the mean-shift algorithm, i.e., a classic, powerful technique for mode seeking, and incorporate it into a contrastive learning framework. The proposed method, dubbed Contrastive Mean-Shift (CMS) learning, trains an image encoder to produce representations with better clustering properties by an iterative process of mean shift and contrastive update. Experiments demonstrate that our method, both in settings with and without the total number of clusters being known, achieves state-of-the-art performance on six public GCD benchmarks without bells and whistles.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Structural-Spectral Graph Convolution with Evidential Edge Learning for Hyperspectral Image Clustering
JojoSCL: Shrinkage Contrastive Learning for single-cell RNA sequence Clustering
Unsupervised Deep Clustering of MNIST with Triplet-Enhanced Convolutional Autoencoders
Robust Variational Contrastive Learning for Partially View-unaligned Clustering
IPCL: Iterative Pseudo-Supervised Contrastive Learning to Improve Self-Supervised Feature Representation
Robust Diversified Graph Contrastive Network for Incomplete Multi-view Clustering
토론
이 논문과 연결된 포럼 글이 아직 없습니다.