News for hackers. Stuff that matters.
Re:E-means: 10x faster k-means at equal loss by loehnsberg on Tuesday November 10, 2026 @02:37AM (#50437227)
You could use X-means instead (https://www.cs.cmu.edu/~dpelleg/download/xmeans.pdf). The idea is to use an information criterion that trades the number of parameters against the reduction in within-cluster variance. The approach essentially splits a cluster when the BIC of the split is larger than without. I’d use this to select k and still run normal k-means though.
Re:E-means: 10x faster k-means at equal loss by swann_bessa on Tuesday November 10, 2026 @05:39AM (#50438425)
Why would you use run normal k-means if e-means gives lower loss and reliably goes much faster ? If you don't believe it you can try e-means at https://e-means.github.io/playground.html
Re:E-means: 10x faster k-means at equal loss by loehnsberg on Tuesday November 10, 2026 @03:08PM (#50445611)
My comment was not about whether or not I believe the claims made by the authors of e-means but how you would solve the problem of choosing the right k.