Centronit: Initial Centroid Designation Algorithm for K-Means Clustering

  • Ali Ridho Barakbah Electronic Engineering Polytechnic Institute of Surabaya
  • Kohei Arai Saga University


Clustering performance of the K-means highly depends on the correctness of initial centroids. Usually initial centroids for the K- means clustering are determined randomly so that the determined initial centers may cause to reach the nearest local minima, not the global optimum. In this paper, we propose an algorithm, called as Centronit, for designation of initial centroidoptimization of K-means clustering. The proposed algorithm is based on the calculation of the average distance of the nearest data inside region of the minimum distance. The initial centroids can be designated by the lowest average distance of each data. The minimum distance is set by calculating the average distance between the data. This method is also robust from outliers of data. The experimental results show effectiveness of the proposed method to improve the clustering results with the K-means clustering.

Keywords: K-means clustering, initial centroids, Kmeansoptimization.


Download data is not yet available.


G.A. Growe, Comparing Algorithms and Clustering Data: Components of The Data Mining Process, Thesis, Department of Computer Science and Information Systems, Grand Valley State University, 1999.

V.E. Castro, Why So Many Clustering Algorithms-A Position Paper, ACM SIGKDD Explorations Newsletter, Volume 4, Issue 1, pp. 65-75, 2002.

H. Ralambondrainy, A Conceptual Version of The K-Means Algorithm, Pattern Recognition Letters 16, pp. 1147-1157, 1995

YM. Cheung, k*-Means: A New Generalized K-Means Clustering Algorithm, Pattern Recognition Letters 24, pp. 2883-2893, 2003.

S.S. Khan, A. Ahmad, Cluster Center Initialization Algorithm for K- Means Clustering, Pattern Recognition Letters, 2004.

B. Kövesi, JM. Boucher, S. Saoudi, Stochastic K-Means Algorithm for Vector Quantization, Pattern Recognition Letters 22, pp. 603-610, 2001.

P.S. Bradley, U.M. Fayyad, Refining Initial Points for K-Means Clustering, Proc. 15th International Conference on Machine Learning (ICML’98), 1998.

J.M. Penã, J.A. Lozano, P. Larrañaga, An Empirical Comparison of The Initilization Methods for The K-Means Algorithm, Pattern Recognition Letters 20, pp. 1027-1040, 1999.

C.J. Veenman, M.J.T. Reinders, E. Backer, A Maximum Variance Cluster Algorithm, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 24, No. 9, pp. 1273-1280, 2002.

S. Ray, R.H. Turi, Determination of Number of Clusters in K-Means Clustering and Application in Colthe Image Segmentation, Proc. 4th ICAPRDT, pp.137-143, 1999.

W.H. Ming, C.J. Hou, Cluster Analysis and Visualization, Workshop on Statistics and Machine Learning, Institute of Statistical Science, Academia Sinica, 2004.

Ali Ridho Barakbah, Kohei Arai, Identifying Moving Variance to Make Automatic Clustering for Normal Dataset, Proc. IECI Japan Workshop 2004 (IJW 2004), Musashi Institute of Technology, Tokyo, 2004.

UCIRepository (http://www.sgi.com/tech/mlc/db/).

C. Yi-tsuu, Interactive Pattern Recognition, Marcel Dekker Inc., New York and Basel, 1978.

R.K. Pearson, T. Zylkin, J.S. Schwaber, G.E. Gonye, Quantitative Evaluation of Clustering Results Using Computational Negative Controls, Proc. 2004 SIAM International Conference on Data Mining, Lake Buena Vista, Florida, 2004.

How to Cite
Barakbah, A. R., & Arai, K. (2014). Centronit: Initial Centroid Designation Algorithm for K-Means Clustering. EMITTER International Journal of Engineering Technology, 2(1), 50-62. https://doi.org/10.24003/emitter.v2i1.17