%0 Journal Article
%A ZHOU Benjin
%A TAO Yizheng
%A JI Bin
%A XIE Yonghui
%T Optimizing k-means initial clustering centers by minimizing sum of squared error
%D 2018
%R 10.3778/j.issn.1002-8331.1706-0223
%J Computer Engineering and Applications
%P 48-52
%V 54
%N 15
%X Traditional k-means algorithm is sensitive to initial clustering centers and isolated points, based on the principal of minimizing the sum of squared error to the most extent, an optimized k-means method is presented on selecting initial clustering centers. At the phase of initial selecting clustering centers, when adding a clustering point each time, compute reduced sum of squared error of each point and select the point that can maximize the square of the reduced error. Using real datasets and compared with the results of other algorithms, the experimental results show the number of iteration is reduced on selecting initial clustering centers and the quality of clustering is improved. Besides, artificial dataset demonstrates the method is much less sensitive to isolated points.
%U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.1706-0223