BanditPAM Alternatives

BanditPAM reviews and mentions

• Want something better than k-means? Try BanditPAM (github.com/motiwari)
  1 project | /r/linux | 27 Jun 2023

  Repo: https://github.com/motiwari/BanditPAM

• [Q] How should I perform clustering on angular data?
  2 projects | /r/statistics | 22 May 2023

  It's written in C++ for speed, but callable from Python and R. It also supports parallelization and intelligent caching at no extra complexity to end users. Its interface also matches the sklearn.cluster.KMeans interface, so minimal changes are necessary to existing code. repo

• Show HN: Want something better than k-means? Try BanditPAM
  1 project | /r/patient_hackernews | 5 Apr 2023
  1 project | /r/hackernews | 5 Apr 2023
  4 projects | news.ycombinator.com | 4 Apr 2023

  Thanks for bug report and repro steps! I've filed this issue at https://github.com/motiwari/BanditPAM/issues/244 on our repo.

  I suspect that this is because the scikit-learn implementation of KMeans subsamples the data and uses some highly-optimized data structures for larger datasets. I've asked the team to see how we can use some of those techniques in BanditPAM and will update the Github repo as we learn more and improve our implementation.

  2 projects | news.ycombinator.com | 29 Mar 2023

  Want something better than k-means? I'm happy to announce our SOTA k-medoids algorithm from NeurIPS 2020, BanditPAM, is now publicly available! `pip install banditpam` or `install.packages("banditpam")` and you're good to go!

  Unlike in k-means, the k-medoids problem requires cluster centers to be actual datapoints, which permits greater interpretability of your cluster centers. k-medoids also works better with arbitrary distance metrics, so your clustering can be more robust to outliers if you're using metrics like L1.

  Despite these advantages, most people don't use k-medoids because prior algorithms were too slow. In our NeurIPS 2020 paper, BanditPAM, we sped up the best known algorithm from O(n^2) to O(nlogn).

  We've released our implementation, which is pip- and CRAN-installable. It's written in C++ for speed, but callable from Python and R. It also supports parallelization and intelligent caching at no extra complexity to end users. Its interface also matches the sklearn.cluster.KMeans interface, so minimal changes are necessary to existing code.

  Our previous announcement that went viral: https://www.linkedin.com/posts/motiwari_want-something-bette...

  PyPI: https://pypi.org/project/banditpam

  CRAN: https://cran.r-project.org/web/packages/banditpam/index.html

  Repo: https://github.com/motiwari/BanditPAM

  Paper: https://arxiv.org/abs/2006.06856

  If you find our work valuable, please consider starring the repo or citing our work. These help us continue development on this project.

  I'm Mo Tiwari (motiwari.com), a PhD student in Computer Science at Stanford University. A special thanks to my collaborators on this project, Martin Jinye Zhang, James Mayclin, Sebastian Thrun, Chris Piech, and Ilan Shomorony, as well as the author of the R package, Balasubramanian Narasimhan.

  (This is my first time posting on HN; I've read the FAQ before posting, but please let me know if I broke any rules)

• A note from our sponsor - SaaSHub
  www.saashub.com | 10 May 2024

  SaaSHub helps you find the best software and product alternatives Learn more →