CCMMR: Minimization of the Convex Clustering Loss Function

Implements the convex clustering through majorization-minimization (CCMM) algorithm described in Touw, Groenen, and Terada (2022) <doi:10.48550/arXiv.2211.01877> to perform minimization of the convex clustering loss function.

Version: 0.2
Depends: R (≥ 4.1), stats (≥ 4.1)
Imports: RANN (≥ 2.6.1), Rcpp (≥ 1.0.7), methods (≥ 4.1.0), graphics (≥ 4.1.0), r2r (≥ 0.1.1)
LinkingTo: Rcpp, RcppEigen
Published: 2023-12-21
DOI: 10.32614/CRAN.package.CCMMR
Author: Daniel Touw ORCID iD [aut, cre], Patrick Groenen ORCID iD [aut], Yoshikazu Terada [aut]
Maintainer: Daniel Touw <touw at>
License: GPL (≥ 3)
NeedsCompilation: yes
Materials: NEWS
CRAN checks: CCMMR results


Reference manual: CCMMR.pdf


Package source: CCMMR_0.2.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): CCMMR_0.2.tgz, r-oldrel (arm64): CCMMR_0.2.tgz, r-release (x86_64): CCMMR_0.2.tgz, r-oldrel (x86_64): CCMMR_0.2.tgz
Old sources: CCMMR archive


Please use the canonical form to link to this page.