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

Fast optimal univariate clustering and segementation by dynamic programming. Three types of problem including univariate k-means, k-median, and k-segments are solved with guaranteed optimality and reproducibility. The core algorithm minimizes the sum of within-cluster distances using respective metrics. Its 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. In contrast to heuristic methods, this package provides a powerful set of tools for univariate data analysis with guaranteed optimality.

Package details

AuthorJoe Song [aut, cre], Haizhou Wang [aut]
Date of publication2017-07-09 06:24:02 UTC
MaintainerJoe Song <[email protected]>
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 July 9, 2017, 9:02 a.m.