Research map / Learning theory and algorithms / Clustering
Sublinear Algorithms for Hierarchical Clustering
Arpit Agarwal, Sanjeev Khanna, Huan Li, Prathamesh Patil
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 |
|---|---|---|---|
| Replace the input graph with an (epsilon,delta)-cut sparsifier | Hierarchical clustering under Dasgupta's objective · Weighted graphs | hierarchical clustering cost: (1+4epsilon)phi; additive n(n+1)delta phi | Improved |
| Embed a constant-degree expander with edge weights delta before effective-resistance sparsification | (epsilon,delta)-cut sparsifier construction · Query model, unweighted graphs | construction time and queries: \widetilde{O}(n \delta^{-1}\epsilon^{-2}) | Improved |
| Use cut sparsification in the dynamic stream | Hierarchical clustering · Dynamic streaming, weighted graphs | space: \widetilde{O}(\epsilon^{-2}n) | Improved |
| Build per-vertex linear sketches in two rounds, then cluster their cut sparsifier | Hierarchical clustering · MPC, weighted graphs | rounds: 2 rounds; \widetilde{O}(n) memory | Improved |
| Use sketches for sparser inputs and random edge subsampling for denser inputs | Hierarchical clustering · MPC, unweighted graphs | rounds: 1 round; \widetilde{O}(n^{4/3}) memory | Improved |
Closest papers by meaning
- Hierarchical Clustering Beyond the Worst-Case (NeurIPS 2017 · similarity 0.92)
- Hierarchical Overlapping Clustering on Graphs: Cost Function, Algorithm and Scalability (ICML 2025 · similarity 0.90)
- New Parallel and Streaming Algorithms for Directed Densest Subgraph (NeurIPS 2025 · similarity 0.88)
- A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering (ICML 2024 · similarity 0.88)
- Ultrametric Cluster Hierarchies: I Want ‘em All! (NeurIPS 2025 · similarity 0.88)
- From Logits to Hierarchies: Hierarchical Clustering made Simple (ICML 2025 · 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.
