The Traditional K-means Clustering Algorithm Research and Improvement
Feng Zhang · Journal of Xianyang Normal University · 2010
The K-means clustering algorithm to solve the problem of the classical algorithm,under some conditions are met,the result of clustering is better.However,this algorithm is sensi-tive to the initial cluster centers,clustering results with different initial input and volatility.Ad-dress this shortcoming,a new distribution based on the data sample selection algorithm the initial cluster centers.