Dimensionally Reduced Open-World Clustering: DROWCULA

• URL: http://arxiv.org/abs/2509.07184v1
• Date: Mon, 08 Sep 2025 20:01:29 GMT
• Title: Dimensionally Reduced Open-World Clustering: DROWCULA
• Authors: Erencem Ozbey, Dimitrios I. Diochnos,
• Abstract summary: We propose a fully unsupervised approach to the problem of determining the novel categories in a particular dataset.<n>We incorporate manifold learning techniques to refine these embeddings by exploiting the intrinsic geometry of the data.<n>Overall, we establish new State-of-the-Art results on single-modal clustering and Novel Class Discovery on CIFAR-10, CIFAR-100, ImageNet-100, and Tiny ImageNet.
• Score: 1.3149034455953847
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Working with annotated data is the cornerstone of supervised learning. Nevertheless, providing labels to instances is a task that requires significant human effort. Several critical real-world applications make things more complicated because no matter how many labels may have been identified in a task of interest, it could be the case that examples corresponding to novel classes may appear in the future. Not unsurprisingly, prior work in this, so-called, `open-world' context has focused a lot on semi-supervised approaches. Focusing on image classification, somehow paradoxically, we propose a fully unsupervised approach to the problem of determining the novel categories in a particular dataset. Our approach relies on estimating the number of clusters using Vision Transformers, which utilize attention mechanisms to generate vector embeddings. Furthermore, we incorporate manifold learning techniques to refine these embeddings by exploiting the intrinsic geometry of the data, thereby enhancing the overall image clustering performance. Overall, we establish new State-of-the-Art results on single-modal clustering and Novel Class Discovery on CIFAR-10, CIFAR-100, ImageNet-100, and Tiny ImageNet. We do so, both when the number of clusters is known or unknown ahead of time. The code is available at: https://github.com/DROWCULA/DROWCULA.

Related papers

• Wasserstein-Aligned Hyperbolic Multi-View Clustering [58.29261653100388]
  This paper proposes a novel Wasserstein-Aligned Hyperbolic (WAH) framework for multi-view clustering.<n>Our method exploits a view-specific hyperbolic encoder for each view to embed features into the Lorentz manifold for hierarchical semantic modeling.
  arXiv  Detail & Related papers  (2025-12-10T07:56:19Z)
• Beyond Known Clusters: Probe New Prototypes for Efficient Generalized Class Discovery [23.359450657842686]
  Generalized Class Discovery (GCD) aims to dynamically assign labels to unlabelled data partially based on knowledge learned from labelled data. We propose an adaptive probing mechanism that introduces learnable potential prototypes to expand cluster prototypes. Our method surpasses the nearest competitor by a significant margin of 9.7% within the Stanford Cars dataset.
  arXiv  Detail & Related papers  (2024-04-13T12:41:40Z)
• Beyond the Known: Novel Class Discovery for Open-world Graph Learning [16.30962452905747]
  We propose an Open-world gRAph neuraL network (ORAL) to tackle novel class discovery on graphs. ORAL first detects correlations between classes through semi-supervised prototypical learning. To fully explore multi-scale graph features for alleviating label deficiencies, ORAL generates pseudo-labels.
  arXiv  Detail & Related papers  (2024-03-29T01:25:05Z)
• Generalized Category Discovery with Clustering Assignment Consistency [56.92546133591019]
  Generalized category discovery (GCD) is a recently proposed open-world task. We propose a co-training-based framework that encourages clustering consistency. Our method achieves state-of-the-art performance on three generic benchmarks and three fine-grained visual recognition datasets.
  arXiv  Detail & Related papers  (2023-10-30T00:32:47Z)
• Deep Multi-View Subspace Clustering with Anchor Graph [11.291831842959926]
  We propose a novel deep multi-view subspace clustering method with anchor graph (DMCAG) DMCAG learns the embedded features for each view independently, which are used to obtain the subspace representations. Our method achieves superior clustering performance over other state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-05-11T16:17:43Z)
• Open-World Weakly-Supervised Object Localization [26.531408294517416]
  We introduce a new weakly-supervised object localization task called OWSOL (Open-World Weakly-Supervised Object localization) We propose a novel paradigm of contrastive representation co-learning using both labeled and unlabeled data to generate a complete G-CAM for object localization. We re-organize two widely used datasets, i.e., ImageNet-1K and iNatLoc500, and propose OpenImages150 to serve as evaluation benchmarks for OWSOL.
  arXiv  Detail & Related papers  (2023-04-17T13:31:59Z)
• Generalized Category Discovery [148.32255950504182]
  We consider a highly general image recognition setting wherein, given a labelled and unlabelled set of images, the task is to categorize all images in the unlabelled set. Here, the unlabelled images may come from labelled classes or from novel ones. We first establish strong baselines by taking state-of-the-art algorithms from novel category discovery and adapting them for this task. We then introduce a simple yet effective semi-supervised $k$-means method to cluster the unlabelled data into seen and unseen classes.
  arXiv  Detail & Related papers  (2022-01-07T18:58:35Z)
• Graph Representation Learning via Contrasting Cluster Assignments [57.87743170674533]
  We propose a novel unsupervised graph representation model by contrasting cluster assignments, called as GRCCA. It is motivated to make good use of local and global information synthetically through combining clustering algorithms and contrastive learning. GRCCA has strong competitiveness in most tasks.
  arXiv  Detail & Related papers  (2021-12-15T07:28:58Z)
• CLASTER: Clustering with Reinforcement Learning for Zero-Shot Action Recognition [52.66360172784038]
  We propose a clustering-based model, which considers all training samples at once, instead of optimizing for each instance individually. We call the proposed method CLASTER and observe that it consistently improves over the state-of-the-art in all standard datasets.
  arXiv  Detail & Related papers  (2021-01-18T12:46:24Z)
• UniT: Unified Knowledge Transfer for Any-shot Object Detection and Segmentation [52.487469544343305]
  Methods for object detection and segmentation rely on large scale instance-level annotations for training. We propose an intuitive and unified semi-supervised model that is applicable to a range of supervision.
  arXiv  Detail & Related papers  (2020-06-12T22:45:47Z)
• SCAN: Learning to Classify Images without Labels [73.69513783788622]
  We advocate a two-step approach where feature learning and clustering are decoupled. A self-supervised task from representation learning is employed to obtain semantically meaningful features. We obtain promising results on ImageNet, and outperform several semi-supervised learning methods in the low-data regime.
  arXiv  Detail & Related papers  (2020-05-25T18:12:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.