Nothing
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" <https://proceedings.neurips.cc/paper/2020/file/73b817090081cef1bca77232f4532c5d-Paper.pdf>.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Balasubramanian Narasimhan [aut, cre], Mo Tiwari [aut] (https://motiwari.com) |
| Maintainer | Balasubramanian Narasimhan <naras@stanford.edu> |
| License | MIT + file LICENSE |
| Version | 1.0-1 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the banditpam package in your browser
Any scripts or data that you put into this service are public.
