Research map / Learning theory and algorithms / Clustering
Affinity Clustering: Hierarchical Clustering at Scale
Mohammadhossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, Vahab Mirrokni
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 10x MapReduce workers instead of W (DHT machines fixed) | Affinity clustering (one round) · LiveJournal, Orkut, Friendster, ImageGraph | running time speedup: 4.1x to 9.2x speedup | Improved |
| Use affinity (Boruvka-based) clustering instead of k-means/linkage methods | Affinity clustering · Iris, Wine, Soybean, Digits, Glass (UCI) | Rand index | Mixed |
Closest papers by meaning
- Clustering with Self-Learned Graph Regression (AAAI 2026 · similarity 0.90)
- Sublinear Algorithms for Hierarchical Clustering (NeurIPS 2022 · similarity 0.90)
- Hierarchical Clustering: $O(1)$-Approximation for Well-Clustered Graphs (NeurIPS 2021 · similarity 0.90)
- Hierarchical Clustering Beyond the Worst-Case (NeurIPS 2017 · similarity 0.89)
- Hierarchical Overlapping Clustering on Graphs: Cost Function, Algorithm and Scalability (ICML 2025 · similarity 0.89)
- Hierarchical Agglomerative Graph Clustering in Nearly-Linear Time (ICML 2021 · similarity 0.89)
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.
