Implementations several algorithms for kernel k-means. The default 'OTQT' algorithm is a fast alternative to standard implementations of kernel k-means, particularly in cases with many clusters. For a small number of clusters, the implemented 'MacQueen' method typically performs the fastest. For more details and performance evaluations, see Berlinski and Maitra (2025) <doi:10.1002/sam.70032>.
| Version: | 0.1.3 |
| Imports: | Rcpp |
| LinkingTo: | Rcpp |
| Published: | 2026-02-01 |
| DOI: | 10.32614/CRAN.package.kkmeans |
| Author: | Josh Berlinski [aut, cre] |
| Maintainer: | Josh Berlinski <jdberlinski at gmail.com> |
| License: | GPL-3 |
| NeedsCompilation: | yes |
| Citation: | kkmeans citation info |
| CRAN checks: | kkmeans results |
| Reference manual: | kkmeans.html , kkmeans.pdf |
| Package source: | kkmeans_0.1.3.tar.gz |
| Windows binaries: | r-devel: not available, r-release: kkmeans_0.1.2.zip, r-oldrel: not available |
| macOS binaries: | r-release (arm64): kkmeans_0.1.3.tgz, r-oldrel (arm64): kkmeans_0.1.3.tgz, r-release (x86_64): kkmeans_0.1.3.tgz, r-oldrel (x86_64): kkmeans_0.1.3.tgz |
| Old sources: | kkmeans archive |
Please use the canonical form https://CRAN.R-project.org/package=kkmeans to link to this page.