Improvement of K-Means Clustering Algorithm with Better Initial Centers Based on Variance of Dimension
In this paper, a novel approach for initializing clustering centers of K-Means algorithm is presented.This method is based on the variance of dimension, which is used as keyword to make a full permutation.The results of the full permutation for the primary and secondary sequence of keyword is divided into k subsets to initialize the clustering centers.Four international datesets are used for testing datasets to test the effectiveness of this algorithm.And this algorithm is examined by numerical simulation.Experiments suggest that the initial clustering centers chosen by the optimization method proposed in this paper are very close to the clustering centers of ultimate convergence after clustering iteration.Compared with the traditional K-Means clustering algorithm, this algorithm increase the rationality of algorithm on the initial clustering center selection and improve the accuracy of clustering results, and the clustering results is more stable as well.
K-means Algorithm Dimension Variance Initialization Clustering Center Accuracy
Jing Huang Jianjun Li Hao Tan
College of computer and Information Engineering,Central South University of Forestry and Technology,Changsha Hunan 410000,China
国内会议
金华
英文
1-9
2015-10-30（万方平台首次上网日期，不代表论文的发表时间）