kkmeans
Fast Implementations of Kernel K-Means
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>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.1.3 |
rolling linux/jammy R-4.5 | kkmeans_0.1.3.tar.gz |
44.9 KiB |
0.1.3 |
rolling linux/noble R-4.5 | kkmeans_0.1.3.tar.gz |
45.3 KiB |
0.1.3 |
rolling source/ R- | kkmeans_0.1.3.tar.gz |
17.1 KiB |
0.1.3 |
latest linux/jammy R-4.5 | kkmeans_0.1.3.tar.gz |
44.9 KiB |
0.1.3 |
latest linux/noble R-4.5 | kkmeans_0.1.3.tar.gz |
45.3 KiB |
0.1.3 |
latest source/ R- | kkmeans_0.1.3.tar.gz |
17.1 KiB |
0.1.3 |
2026-04-26 source/ R- | kkmeans_0.1.3.tar.gz |
17.1 KiB |
0.1.3 |
2026-04-23 source/ R- | kkmeans_0.1.3.tar.gz |
17.1 KiB |
0.1.3 |
2026-04-09 windows/windows R-4.5 | kkmeans_0.1.3.zip |
52.4 KiB |