CRAN/E | ddc

ddc

Distance Density Clustering Algorithm

Installation

About

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).

Key Metrics

Version 1.0.1
R ≥ 4.2
Published 2022-12-14 510 days ago
Needs compilation? yes
License GPL-2
License GPL-3
CRAN checks ddc results
Language en-US

Downloads

Yesterday 1 0%
Last 7 days 23 -51%
Last 30 days 132 -2%
Last 90 days 359 -30%
Last 365 days 1.619 +57%

Maintainer

Maintainer

Ruizhe Ma

maruizhe.cs@gmail.com

Authors

Ruizhe Ma

cre / aut

Bing Jiang

aut

Material

Reference manual
Package source

Vignettes

intro

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-develnot available

x86_64

r-releasenot available

x86_64

r-oldrelnot available

x86_64

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