AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Massively Parallel Algorithms and Hardness for Single-Linkage Clustering under $\ell_p$ Distances

ICML 2018 · Learning theory and algorithms › Clustering · approach: Coresets and dynamic clustering · 21 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 changedWhereMeasuredEffect
Use the proposed Spark implementation instead of sequential Prim's algorithmℓ2 single-linkage clustering · Image, KDDCUP04Bio, Shuttle, and US Census datasetsruntime speedup: more than an order of magnitudeHelped
Use the proposed Spark implementation instead of sequential Prim's algorithmℓ2 single-linkage clustering · SIFT10M and HIGGSruntime: 1.2\times 10^5 s; 8.4 \times 10^4 sMixed
Increase the approximation parameter ηSpark implementation of ℓ2 single-linkage clustering · KDDCUP04Bio and US Censusruntime speedupHelped
Use the partition-based approximate MST approachℓ1, ℓ2, and ℓ∞ single-linkage clustering · Constant-dimensional vector dataMPC rounds: O(log n)Helped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy