Search Results for author: James Mayclin

Found 2 papers, 2 papers with code

BanditPAM: Almost Linear Time k-Medoids Clustering via Multi-Armed Bandits

1 code implementation NeurIPS 2020 Mo Tiwari, Martin J. Zhang, James Mayclin, Sebastian Thrun, Chris Piech, Ilan Shomorony

In these experiments, we observe that BanditPAM returns the same results as state-of-the-art PAM-like algorithms up to 4x faster while performing up to 200x fewer distance computations.

Multi-Armed Bandits

BanditPAM: Almost Linear Time $k$-Medoids Clustering via Multi-Armed Bandits

2 code implementations11 Jun 2020 Mo Tiwari, Martin Jinye Zhang, James Mayclin, Sebastian Thrun, Chris Piech, Ilan Shomorony

Current state-of-the-art $k$-medoids clustering algorithms, such as Partitioning Around Medoids (PAM), are iterative and are quadratic in the dataset size $n$ for each iteration, being prohibitively expensive for large datasets.

Multi-Armed Bandits

Cannot find the paper you are looking for? You can Submit a new open access paper.