HackerByte

E-means: Outperforming k-means in one-tenth the epochs

A new approach is presented that increases the performance of the k-means clustering algorithm by 10x with an equal loss rate.

Hacker News submitter: porridgeraisin

Submitted to Hacker News:

Original source Hacker News discussion