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" <https://proceedings.neurips.cc/paper/2020/file/73b817090081cef1bca77232f4532c5d-Paper.pdf>.
Version: 1.0-2 Depends: R (≥ 3.5.0) Imports: R6, Rcpp LinkingTo: Rcpp, RcppArmadillo Suggests: ggplot2, knitr, MASS, rmarkdown, tinytest Published: 2025-06-02 DOI: 10.32614/CRAN.package.banditpam Author: Balasubramanian Narasimhan [aut, cre], Mo Tiwari [aut] (https://motiwari.com) Maintainer: Balasubramanian Narasimhan <naras at stanford.edu> BugReports: https://github.com/motiwari/BanditPAM/issues License: MIT + file LICENSE NeedsCompilation: yes SystemRequirements: C++17 Materials: README NEWS CRAN checks: banditpam results Documentation: Reference manual: banditpam.pdf Vignettes: Almost Linear-Time k-Medoids Clustering (source, R code)Please use the canonical form https://CRAN.R-project.org/package=banditpam to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4