Does K-means clustering algorithm really finds the global minimum or not?

@adityashrm21 wrote:

Hello,

The K-means clustering algorithms uses the square of the Euclidean distance
to find the global minimum solution and this problem is not trivial. Does this mean that the K-means algorithm only tries to find the global minimum solution and it is not guaranteed that it will actually find it?
If its true, how can we rely on the accuracy of the algorithm?

Thanks

Posts: 2

Participants: 2

Read full topic