SuperEMeans: Making e-means 3× faster
TL;DR: We fused SuperKMeans and e-means, resulting in 3× faster clustering of high-dimensional vectors without quality trade-offs. Available now at https://github.com/cwida/SuperKMeans. Recently, there has been a lot of buzz around clustering of vector embeddings: EVōC, SuperKMeans, QGKmeans, and just last week, e-means, o-means, and s-means. Among these, e-means is a big deal: it promises the same quality as Lloyd’s with only 2 epochs. Why is this a big deal for vector search? Well, clustering
Read full article →