Ckmeans.1d.dp: Optimal k-means Clustering in One Dimension by Dynamic Programming

Authors

Haizhou Wang, NewMexico State University
Mingzhou Song, NewMexico State University

Date of this Version

12-2011

Document Type

Article

Citation

The R Journal (December 2011) 3(2)

Comments

Copyright 2011, The R Foundation. Open access material. License: CC BY 3.0 Unported

Abstract

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 ad vantage in optimality and runtime over the standard iterative k-means algorithm.