Ckmeans.1d.dp: Optimal and Fast Univariate Clustering
Version 4.2.0

A fast dynamic programming algorithmic framework to achieve optimal univariate k-means, k-median, and k-segments clustering. Minimizing the sum of respective within-cluster distances, the algorithms guarantee optimality and reproducibility. Their advantage over heuristic clustering algorithms in efficiency and accuracy is increasingly pronounced as the number of clusters k increases. Weighted k-means and unweighted k-segments algorithms 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.

Package details

AuthorJoe Song [aut, cre], Haizhou Wang [aut]
Date of publication2017-05-30 05:51:09 UTC
MaintainerJoe Song <>
LicenseLGPL (>= 3)
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the Ckmeans.1d.dp package in your browser

Any scripts or data that you put into this service are public.

Ckmeans.1d.dp documentation built on May 31, 2017, 5:17 a.m.