# Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D

25 Jan 2017Allan GrønlundKasper Green LarsenAlexander MathiasenJesper Sindahl NielsenStefan SchneiderMingzhou Song

The $k$-Means clustering problem on $n$ points is NP-Hard for any dimension $d\ge 2$, however, for the 1D case there exists exact polynomial time algorithms. Previous literature reported an $O(kn^2)$ time dynamic programming algorithm that uses $O(kn)$ space... (read more)

PDF Abstract