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.
- Version1.0-1
- R version≥ 3.5.0
- LicenseMIT
- LicenseLICENSE
- Needs compilation?Yes
- Last release03/15/2023
Documentation
Team
Balasubramanian Narasimhan
MaintainerShow author detailsMo Tiwari
Insights
Last 30 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN