Re:Show HN: Want something better than k-means? Try BanditPAM
by motiwari on Wednesday April 05, 2023 @03:30PM
(#35459248)
Really funny that you mention that! Some of our more recent work focuses on using adaptive sampling techniques in approximate-nearest-neighbor search (actually, the related problem of maximum inner product search: https://arxiv.org/abs/2212.07551).
We definitely think that our approach could be used to make an index structure for ANN search directly, for example in conjunction with Hierarchical Navigable Small World approaches.
Re:Show HN: Want something better than k-means? Try BanditPAM
by eternalban on Wednesday April 05, 2023 @04:32PM
(#35459964)
Thanks for sharing your great work!
[Try this tool from arxiv labs (just replace the x in original url with a 5)]
Have you tried BanditPAM as an index creation technique for approximate-nearest-neighbor search?