Study on Clustering Method Based on K-Means Algorithm

Enhancing the K-Means clustering algorithm with the least distance algorithm

Abstract

In this paper we join the biggest least distance algorithm and the conventional K-Means algorithm to propose a further developed K-Means clustering algorithm. This further developed algorithm can make up the weaknesses for the conventional K-Means algorithm to decide the underlying point of convergence. The further developed K-Means algorithm adequately tackled two detriments of the conventional algorithm, the first is more noteworthy reliance to decision the underlying point of convergence, and another is not difficult to be caught in neighborhood minimum[1][2].