Local vs global interactions in clustering algorithms: Advances over K-means

Wesam Ashour Barbakh, Colin Fyfe · International Journal of Knowledge-based and Intelligent Engineering Systems · 2008

We discuss one of the shortcomings of the standard K-means algorithm – its tendency to converge to a local rather than a global optimum. This is often accommodated by means of different random restarts of the algorithm, however in this paper, we atta

Read the paper · More papers on PaperTik