Use dynamic programming method to solve l1 convex clustering with identical weights.
| Version: | 1.0.0 |
| Imports: | Rcpp |
| LinkingTo: | Rcpp |
| Suggests: | testthat (≥ 3.0.0) |
| Published: | 2021-06-01 |
| DOI: | 10.32614/CRAN.package.dpcc |
| Author: | Bingyuan Zhang, Jie Chen, Yoshikazu Terada |
| Maintainer: | Bingyuan Zhang <zhang at sigmath.es.osaka-u.ac.jp> |
| License: | MIT + fileLICENSE |
| NeedsCompilation: | yes |
| Materials: | README,NEWS |
| CRAN checks: | dpcc results |
| Reference manual: | dpcc.html ,dpcc.pdf |
| Package source: | dpcc_1.0.0.tar.gz |
| Windows binaries: | r-devel:dpcc_1.0.0.zip, r-release:dpcc_1.0.0.zip, r-oldrel:dpcc_1.0.0.zip |
| macOS binaries: | r-release (arm64):dpcc_1.0.0.tgz, r-oldrel (arm64):dpcc_1.0.0.tgz, r-release (x86_64):dpcc_1.0.0.tgz, r-oldrel (x86_64):dpcc_1.0.0.tgz |
Please use the canonical formhttps://CRAN.R-project.org/package=dpccto link to this page.