Thanks for the attention! (It's all that matters) : https://jjd.io/posts/a-resolution-dial-for-e-means.html

Long story short... e-means produced better results than my dyf algorithm for the majority of the datasets I used as a comparison. But, dyf still managed to be much faster (which matters more for the embedding work that I do).

I did a bit of open heart surgery and transplanted the recursive partitioner from dyf into e-means, and found that it can work really well to auto-select the k-parameter (at least in everyone's favorite mnist example).