Statistics, Department of

 

The R Journal

Accessibility Remediation

If you are unable to use this item in its current form due to accessibility barriers, you may request remediation through our remediation request form.

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.

Share

COinS