Research map / Learning theory and algorithms / Clustering
Foundations of Comparison-Based Hierarchical Clustering
Debarghya Ghoshdastidar, Michaël Perrot, Ulrike von Luxburg
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use 4K-AL active comparisons instead of single or complete linkage | Comparison-based hierarchical clustering · Planted hierarchical model | signal-to-noise ratio required for exact recovery | Improved |
| Use 4-AL instead of 4K-AL | Comparison-based hierarchical clustering · Planted hierarchical model | AARI | Improved |
| Add initial pure clusters of size 5 (ablation) | 4-AL · Planted hierarchical model | AARI | Improved |
| Add initial pure clusters of size 3 (ablation) | 4-AL · Planted hierarchical model | AARI | Mixed |
| Use single linkage instead of the proposed average-linkage variants | Comparison-based hierarchical clustering · Planted hierarchical model | AARI | Hurt |
| Use complete linkage instead of single linkage | Comparison-based hierarchical clustering · Planted hierarchical model | AARI | Improved |
| Reduce the proportion of passively sampled comparisons | 4K-AL and 4-AL · Planted hierarchical model | AARI | No clear effect |
| Reduce the proportion of passively sampled comparisons | 4-AL and 4K-AL · Zoo, Glass, 20news | Dasgupta's cost | No clear effect |
| Use comparison-based methods instead of ordinal embedding followed by average linkage | Hierarchical clustering · Zoo, Glass, 20news | Dasgupta's cost | Mixed |
| Use ordinal embedding with a poorly chosen embedding dimension (ablation) | tSTE-AL and FORTE-AL · Zoo, Glass, 20news | Dasgupta's cost | Hurt |
Closest papers by meaning
- Ultrametric Cluster Hierarchies: I Want ‘em All! (NeurIPS 2025 · similarity 0.88)
- Hierarchical Overlapping Clustering on Graphs: Cost Function, Algorithm and Scalability (ICML 2025 · similarity 0.88)
- New Bounds on the Cohesion of Complete-link and Other Linkage Methods for Agglomerative Clustering (ICML 2024 · similarity 0.87)
- On the cohesion and separability of average-link for hierarchical agglomerative clustering (NeurIPS 2024 · similarity 0.87)
- From Logits to Hierarchies: Hierarchical Clustering made Simple (ICML 2025 · similarity 0.86)
- Average Sensitivity of Hierarchical $k$-Median Clustering (ICML 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
