ddc: Distance Density Clustering Algorithm

A distance density clustering (DDC) algorithm in R. DDC uses dynamic time warping (DTW) to compute a similarity matrix, based on which cluster centers and cluster assignments are found. DDC inherits dynamic time warping (DTW) arguments and constraints. The cluster centers are centroid points that are calculated using the DTW Barycenter Averaging (DBA) algorithm. The clustering process is divisive. At each iteration, cluster centers are updated and data is reassigned to cluster centers. Early stopping is possible. The output includes cluster centers and clustering assignment, as described in the paper (Ma et al (2017) <doi:10.1109/ICDMW.2017.11>).

Version: 1.0.1
Depends: R (≥ 4.2)
Imports: dtw (≥ 1.22), dtwclust (≥ 5.5), parallel (≥ 4.2), magrittr (≥ 2.0), utils
Suggests: knitr, rmarkdown, spelling, testthat (≥ 3.0.0)
Published: 2022-12-14
Author: Ruizhe Ma [cre, aut], Bing Jiang [aut]
Maintainer: Ruizhe Ma <maruizhe.cs at gmail.com>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
NeedsCompilation: yes
Language: en-US
CRAN checks: ddc results


Reference manual: ddc.pdf
Vignettes: intro


Package source: ddc_1.0.1.tar.gz
Windows binaries: r-devel: ddc_1.0.1.zip, r-release: ddc_1.0.1.zip, r-oldrel: not available
macOS binaries: r-release (arm64): ddc_1.0.1.tgz, r-oldrel (arm64): not available, r-release (x86_64): ddc_1.0.1.tgz, r-oldrel (x86_64): not available


Please use the canonical form https://CRAN.R-project.org/package=ddc to link to this page.