A fast dynamic programming algorithm for optimal univariate clustering. Minimizing the sum of squares of within-cluster distances, the algorithm guarantees optimality and reproducibility. Its advantage over heuristic clustering algorithms in efficiency and accuracy is increasingly pronounced as the number of clusters k increases. With optional weights, the algorithm can also optimally segment time series and perform peak calling. An auxiliary function generates histograms that are adaptive to patterns in data. This package provides a powerful alternative to heuristic methods for univariate data analysis.

Maintainer: Joe Song <joemsong at cs.nmsu.edu>

Author(s): Joe Song*, Haizhou Wang*

Install package and any missing dependencies by running this line in your R console:

install.packages("Ckmeans.1d.dp")

Depends R (>= 2.10.0)
Imports
Suggests testthat, knitr, rmarkdown
Enhances
Linking to
Reverse
depends
Reverse
imports
gsrc, Tnseq
Reverse
suggests
FunChisq, xgboost
Reverse
enhances
Reverse
linking to

Package Ckmeans.1d.dp
Materials
URL
Task Views
Version 4.0.1
Published 2017-02-16
License LGPL (>= 3)
BugReports
SystemRequirements
NeedsCompilation yes
Citation
CRAN checks Ckmeans.1d.dp check results
Package source Ckmeans.1d.dp_4.0.1.tar.gz