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

no code implementations • ICML 2018 • Grigory Yaroslavtsev, Adithya Vadapalli

We present first massively parallel (MPC) algorithms and hardness of approximation results for computing Single-Linkage Clustering of n input d-dimensional vectors under Hamming, $\ell_1, \ell_2$ and $\ell_\infty$ distances.

Clustering