Interpretable Text-Guided Image Clustering via Iterative Search

• URL: http://arxiv.org/abs/2506.12514v1
• Date: Sat, 14 Jun 2025 13:58:56 GMT
• Title: Interpretable Text-Guided Image Clustering via Iterative Search
• Authors: Bingchen Zhao, Oisin Mac Aodha,
• Abstract summary: Distinct users may want to use different criteria to form clusters in the same data.<n>We propose a new text-guided clustering approach named ITGC that uses an iterative discovery process, guided by an unsupervised clustering objective.<n>We report superior performance compared to existing methods across a wide variety of image clustering and fine-grained classification benchmarks.
• Score: 22.032915471999864
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Traditional clustering methods aim to group unlabeled data points based on their similarity to each other. However, clustering, in the absence of additional information, is an ill-posed problem as there may be many different, yet equally valid, ways to partition a dataset. Distinct users may want to use different criteria to form clusters in the same data, e.g. shape v.s. color. Recently introduced text-guided image clustering methods aim to address this ambiguity by allowing users to specify the criteria of interest using natural language instructions. This instruction provides the necessary context and control needed to obtain clusters that are more aligned with the users' intent. We propose a new text-guided clustering approach named ITGC that uses an iterative discovery process, guided by an unsupervised clustering objective, to generate interpretable visual concepts that better capture the criteria expressed in a user's instructions. We report superior performance compared to existing methods across a wide variety of image clustering and fine-grained classification benchmarks.

Related papers

• Personalized Clustering via Targeted Representation Learning [12.685373069492448]
  Clustering traditionally aims to reveal a natural grouping structure within unlabeled data.<n>We propose a personalized clustering method that explicitly performs targeted representation learning.
  arXiv  Detail & Related papers  (2024-12-18T10:28:51Z)
• Organizing Unstructured Image Collections using Natural Language [37.16101036513514]
  We introduce the task of Open-ended Semantic Multiple Clustering (OpenSMC), which aims to automatically discover clustering criteria from large, unstructured image collections.<n>Our framework, X-Cluster: eXploratory Clustering, treats text as a reasoning proxy, and groups images into meaningful clusters per criterion.<n>X-Cluster effectively reveals meaningful partitions and enables downstream applications such as bias discovery and social media image popularity analysis.
  arXiv  Detail & Related papers  (2024-10-07T17:21:46Z)
• Text-Guided Alternative Image Clustering [11.103514372355088]
  This work explores the potential of large vision-language models to facilitate alternative image clustering. We propose Text-Guided Alternative Image Consensus Clustering (TGAICC), a novel approach that leverages user-specified interests via prompts. TGAICC outperforms image- and text-based baselines on four alternative image clustering benchmark datasets.
  arXiv  Detail & Related papers  (2024-06-07T08:37:57Z)
• 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)
• Using Decision Trees for Interpretable Supervised Clustering [0.0]
  supervised clustering aims at forming clusters of labelled data with high probability densities. We are particularly interested in finding clusters of data of a given class and describing the clusters with the set of comprehensive rules.
  arXiv  Detail & Related papers  (2023-07-16T17:12:45Z)
• XCon: Learning with Experts for Fine-grained Category Discovery [4.787507865427207]
  We present a novel method called Expert-Contrastive Learning (XCon) to help the model to mine useful information from the images. Experiments on fine-grained datasets show a clear improved performance over the previous best methods, indicating the effectiveness of our method.
  arXiv  Detail & Related papers  (2022-08-03T08:03:12Z)
• A Proposition-Level Clustering Approach for Multi-Document Summarization [82.4616498914049]
  We revisit the clustering approach, grouping together propositions for more precise information alignment. Our method detects salient propositions, clusters them into paraphrastic clusters, and generates a representative sentence for each cluster by fusing its propositions. Our summarization method improves over the previous state-of-the-art MDS method in the DUC 2004 and TAC 2011 datasets.
  arXiv  Detail & Related papers  (2021-12-16T10:34:22Z)
• Self-supervised Contrastive Attributed Graph Clustering [110.52694943592974]
  We propose a novel attributed graph clustering network, namely Self-supervised Contrastive Attributed Graph Clustering (SCAGC) In SCAGC, by leveraging inaccurate clustering labels, a self-supervised contrastive loss, are designed for node representation learning. For the OOS nodes, SCAGC can directly calculate their clustering labels.
  arXiv  Detail & Related papers  (2021-10-15T03:25:28Z)
• You Never Cluster Alone [150.94921340034688]
  We extend the mainstream contrastive learning paradigm to a cluster-level scheme, where all the data subjected to the same cluster contribute to a unified representation. We define a set of categorical variables as clustering assignment confidence, which links the instance-level learning track with the cluster-level one. By reparametrizing the assignment variables, TCC is trained end-to-end, requiring no alternating steps.
  arXiv  Detail & Related papers  (2021-06-03T14:59:59Z)
• Graph Contrastive Clustering [131.67881457114316]
  We propose a novel graph contrastive learning framework, which is then applied to the clustering task and we come up with the Graph Constrastive Clustering(GCC) method. Specifically, on the one hand, the graph Laplacian based contrastive loss is proposed to learn more discriminative and clustering-friendly features. On the other hand, a novel graph-based contrastive learning strategy is proposed to learn more compact clustering assignments.
  arXiv  Detail & Related papers  (2021-04-03T15:32:49Z)
• Scalable Hierarchical Agglomerative Clustering [65.66407726145619]
  Existing scalable hierarchical clustering methods sacrifice quality for speed. We present a scalable, agglomerative method for hierarchical clustering that does not sacrifice quality and scales to billions of data points.
  arXiv  Detail & Related papers  (2020-10-22T15:58:35Z)

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.