# Overcoming the problem (found in K-means) of clusters of different diameter

I have a theoretical problem, I think it is easier to show it instead of talking about it:

So by visual examination we got 2 clusters, which k-means does not necessarily get, because some points on the edge of the bigger cluster are closer to the center of the smaller cluster than to the center of the bigger one. A possible solution would be to move closer to the second cluster with the centroid of the first cluster. I am not sure whether k-means does this (probably not), but if we have multiple small clusters around the big one, this does not help either. How could we modify the k-means to overcome this? Are there clustering algorithms, which don't have this weakness?

• @ttnphns I have not a clue how to modify k-means to overcome this problem (probably there are many different ways to do that). If you think your proposition with rings is a possible solution, then it is just as good answer as the other, which recommends density based clustering instead. Mar 27, 2018 at 8:58
• Did you even read just the Wikipedia article? Or a clustering book? There is so much more than kmeans. Mar 28, 2018 at 7:34
• @Anony-Mousse I liked to learn k-means, because I watched a video about it, and it was very easy to understand what it does. On the other hand wikipedia is full of mathematical formulas usually without any good explanation, so for a beginner it is close to impossible to learn statistics/clustering from there. I bought some statistics books, but I haven't had the time to read them yet. Mar 28, 2018 at 9:41