Ckmeans.1d.dp: Optimal distance-based clustering for one-dimensional data
This package contains a function to cluster
one-dimensional data optimally using dynamic programming to
minimize the sum of squares of within cluster distances. It
provides an alternative to the heuristic k-means algorithm
which does not guarantee optimality.
| Version: |
2.2 |
| Depends: |
R (≥ 2.10.0) |
| Published: |
2011-06-18 |
| Author: |
Joe Song and Haizhou Wang |
| Maintainer: |
Haizhou Wang <hwang at cs.nmsu.edu> |
| License: |
LGPL (≥ 3) |
| CRAN checks: |
Ckmeans.1d.dp results |
Downloads:
Reverse dependencies: