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.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.2.1 |
rolling linux/jammy R-4.5 | CCMMR_0.2.1.tar.gz |
3.2 MiB |
0.2.1 |
rolling linux/noble R-4.5 | CCMMR_0.2.1.tar.gz |
3.2 MiB |
0.2.1 |
rolling source/ R- | CCMMR_0.2.1.tar.gz |
3.1 MiB |
0.2.1 |
latest linux/jammy R-4.5 | CCMMR_0.2.1.tar.gz |
3.2 MiB |
0.2.1 |
latest linux/noble R-4.5 | CCMMR_0.2.1.tar.gz |
3.2 MiB |
0.2.1 |
latest source/ R- | CCMMR_0.2.1.tar.gz |
3.1 MiB |
0.2.1 |
2026-04-26 source/ R- | CCMMR_0.2.1.tar.gz |
3.1 MiB |
0.2.1 |
2026-04-23 source/ R- | CCMMR_0.2.1.tar.gz |
3.1 MiB |
0.2.1 |
2026-04-09 windows/windows R-4.5 | CCMMR_0.2.1.zip |
3.6 MiB |
0.2.1 |
2025-04-20 source/ R- | CCMMR_0.2.1.tar.gz |
3.1 MiB |