Research map / Learning theory and algorithms / Clustering
Hierarchical Clustering with Structural Constraints
Vaggos Chatziafratis, Rad Niazadeh, Moses Charikar
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 |
|---|---|---|---|
| Add triplet constraints to noisy spectral clustering | Recursive spectral clustering · Zoo (20 animals) | Dasgupta's HC cost: 1286 -> 1142 | Improved |
| Add triplet constraints to noisy spectral clustering | Recursive spectral clustering · Zoo (50 animals) | Dasgupta's HC cost: 25216 -> 23443 | Improved |
| Add triplet constraints to noisy spectral clustering | Recursive spectral clustering · Zoo (80 animals) | Dasgupta's HC cost: 99211 -> 90419 | Improved |
| Add triplet constraints to noisy spectral clustering | Recursive spectral clustering · Zoo (100 animals) | Dasgupta's HC cost: 190205 -> 173499 | Improved |
Closest papers by meaning
- Ultrametric Cluster Hierarchies: I Want ‘em All! (NeurIPS 2025 · similarity 0.90)
- Towards Better-than-2 Approximation for Constrained Correlation Clustering (ICML 2025 · similarity 0.88)
- Average Sensitivity of Hierarchical $k$-Median Clustering (ICML 2025 · similarity 0.88)
- Efficient Constrained K-center Clustering with Background Knowledge (AAAI 2024 · similarity 0.88)
- New Bounds on the Cohesion of Complete-link and Other Linkage Methods for Agglomerative Clustering (ICML 2024 · similarity 0.88)
- Expected Probabilistic Hierarchies (NeurIPS 2024 · similarity 0.88)
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.
