News for hackers. Stuff that matters.

A comment on E-means: 10x faster k-means at equal loss. Parent comment

Re:E-means: 10x faster k-means at equal loss by haifeng on Tuesday November 10, 2026 @12:50PM (#50443664)
Look deeper, I am not sure that we can combine BBD-tree with E-Means. BBD-tree is a data structure built on the whole dataset, while the core idea in E-Means is mini-batch with exponential moving average updates.
[ Parent | on HN ]

There are no comments on this comment yet.