title: Ckmeans.1d.dp: Optimalk-means Clustering in One Dimension by Dynamic Programming.
abstract: The heuristick-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 calledCkmeans.1d.dp. We demonstrate its advantage in optimality and runtime over the standard iterativek-means algorithm.
authors.affiliation: Department of Computer Science, New Mexico State University, United States.
authors.forename: Haizhou
authors.initials: H
authors.lastname: Wang
authors.affiliation: Department of Computer Science, New Mexico State University, United States.
authors.forename: Mingzhou
authors.initials: M
authors.lastname: Song