A3S: A General Active Clustering Method with Pairwise Constraints
Not on the map. Why?
Abstract (arXiv)
Active clustering aims to boost the clustering performance by integrating human-annotated pairwise constraints through strategic querying. Conventional approaches with semi-supervised clustering schemes encounter high query costs when applied to large datasets with numerous classes. To address these limitations, we propose a novel Adaptive Active Aggregation and Splitting (A3S) framework, falling within the cluster-adjustment scheme in active clustering. A3S features strategic active clustering adjustment on the initial cluster result, which is obtained by an adaptive clustering algorithm. In particular, our cluster adjustment is inspired by the quantitative analysis of Normalized mutual information gain under the information theory framework and can provably improve the clustering quality. The proposed A3S framework significantly elevates the performance and scalability of active clustering. In extensive experiments across diverse real-world datasets, A3S achieves desired results with significantly fewer human queries compared with existing methods.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 11 of its 45 references that are in the map. First posted on arXiv 14 Jul 2024.
Builds on
11 of 45 references.
References · 11
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,857
- 2016MS-Celeb-1M: A Dataset and Benchmark for Large-Scale Face Recognitioncited by 624
- 2021SSSNET: Semi-Supervised Signed Network Clusteringcited by 20
- 2020k-means++: few more steps yield constant approximationcited by 16
- 2018COBRA: A Fast and Simple Method for Active Clustering with Pairwise Constraintscited by 9
- 2023Semi-Supervised Constrained Clustering: An In-Depth Overview, Ranked Taxonomy and Future Research Directionscited by 8
- 2018ADBSCAN: Adaptive Density-Based Spatial Clustering of Applications with Noise for Identifying Clusters with Varying Densitiescited by 4
- 2021Query-augmented Active Metric Learningcited by 4
- 2020A semi-supervised sparse K-Means algorithmcited by 3
- 2021Active clustering for labeling training datacited by 1
- 2023Self-Learning Symmetric Multi-view Probabilistic Clusteringcited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 2025Less is More: Improving LLM Alignment via Preference Data Selectioncited by 4
- 2026Optimized Algorithms for Text Clustering with LLM-Generated Constraintscited by 2
- 2026IPBC: An Interactive Projection-Based Framework for Human-in-the-Loop Semi-Supervised Clustering of High-Dimensional Datacited by 0
- 2026IPBC: An Interactive Projection-Based Framework for Human-in-the-Loop Semi-Supervised Clustering of High-Dimensional Data25 Jan 2026
- 2026Optimized Algorithms for Text Clustering with LLM-Generated Constraints16 Jan 2026
- 2025Less is More: Improving LLM Alignment via Preference Data Selection20 Feb 2025