A K-means Algorithm Based on Optimized Initial Center Points

Aiming at the problems of K-means algorithm,a method is proposed to optimize the initial center points through computing the density of objects.Thus,the initial center of the samples can be built in a heuristic way.Then,a new evaluation function is proposed,namely equalization function,and consequently the cluster number is generated automatically.Compared with the traditional algorithms,the proposed algorithm can get initial centers with higher quality and steadier cluster results.Experimental results show the effectiveness and feasibility of the proposed algorithm.