Answers are grounded in this paper and cite their sources.
The heuristic k-means algorithm, widely used for cluster analysis, does not guarantee optimality. We developed a dynamic programming algorithm for optimal one-dimensional clustering. The algorithm is implemented as an R package called Ckmeans.1d.dp. We demonstrate its advantage in optimality and runtime over the standard iterative k-means algorithm.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: