banditpam: Almost Linear-Time k-Medoids Clustering

Interface to a high-performance implementation of k-medoids clustering described in Tiwari, Zhang, Mayclin, Thrun, Piech and Shomorony (2020) "BanditPAM: Almost Linear Time k-medoids Clustering via Multi-Armed Bandits" <>.

Version: 1.0-1
Depends: R (≥ 3.5.0)
Imports: R6, Rcpp
LinkingTo: Rcpp, RcppArmadillo
Suggests: ggplot2, knitr, MASS, rmarkdown, tinytest
Published: 2023-03-15
DOI: 10.32614/CRAN.package.banditpam
Author: Balasubramanian Narasimhan [aut, cre], Mo Tiwari [aut] (
Maintainer: Balasubramanian Narasimhan <naras at>
License: MIT + file LICENSE
NeedsCompilation: yes
SystemRequirements: C++17
Materials: README NEWS
CRAN checks: banditpam results


Reference manual: banditpam.pdf
Vignettes: Almost Linear-Time k-Medoids Clustering


Package source: banditpam_1.0-1.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): banditpam_1.0-1.tgz, r-oldrel (arm64): banditpam_1.0-1.tgz, r-release (x86_64): banditpam_1.0-1.tgz, r-oldrel (x86_64): banditpam_1.0-1.tgz
Old sources: banditpam archive


Please use the canonical form to link to this page.