Aleta C. Fabregas; Bobby D. Gerardo; Bartolome T. Tanguilig III

Enhanced Initial Centroids for K-means Algorithm

Full Text (PDF, 731KB), PP.26-33

Views: 0 Downloads: 0

Author(s)

Aleta C. Fabregas ^1,* Bobby D. Gerardo ² Bartolome T. Tanguilig III ³

1. Graduate Programs, Technological Institute of the Philippines, Quezon City, Philippines

2. Institute of Information and Communication Technology, West Visayas State University, Lapaz, Iloilo City, Philippines

3. AMA Head Office, Panay Avenue, Quezon City, Philippines

* Corresponding author.

DOI: https://doi.org/10.5815/ijitcs.2017.01.04

Received: 11 Mar. 2016 / Revised: 6 Jul. 2016 / Accepted: 1 Oct. 2016 / Published: 8 Jan. 2017

Index Terms

K-means algorithm, Euclidian Distance, Centroids, Clustering, Enhanced-K-means algorithm Weighted Average mean

Abstract

This paper focuses on the enhanced initial centroids for the K-means algorithm. The original k-means is using the random choice of initial seeds which is a major limitation of the original K-means algorithm because it produces less reliable result of clustering the data. The enhanced method of the k-means algorithm includes the computation of the weighted mean to improve the centroids initialization. This paper shows the comparison between K-Means and the enhanced K-Means algorithm, and it proves that the new method of selecting initial seeds is better in terms of mathematical computation and reliability.

Cite This Paper

Aleta C. Fabregas, Bobby D. Gerardo, Bartolome T. Tanguilig III, "Enhanced Initial Centroids for K-means Algorithm", International Journal of Information Technology and Computer Science(IJITCS), Vol.9, No.1, pp.26-33, 2017. DOI:10.5815/ijitcs.2017.01.04

Reference

[1]K-means Clustering RTMath, Available at:rtmath.net/help/html/ Retrieved: May 22, 2016
[2]J.C.Da Costa, M.D. Ortigueira and A. G. Batista, “ K-means Clustering for Sleep Spindles Classification”, International Journal of Information Technology and Computer Science(IJITCS), ISSN 2091-1610 Volume 10, Issue - 3 ,pp 77 – 85, August 2013
[3]V. Kathiresan., “An Efficient Clustering Algorithm based on Z score Ranking Method”, International Conference on Computer Communication and Informatics(ICCCI), ISBN:978-1-4577-1583-9/12, 2012, © IEEE DOI: 10.1109/ICCI.2012.6158779
[4]Kushwah S. P. S. Rawat K, and Gupta P, ”Analysis and Comparison of Efficient Techniques of Clustering Algorithms in Data Mining”, International Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075,Volume-1,Issue-3, pp. 109–
113,2012
[5]A Tutorial on Clustering Algorithms ,Intranet, home.deib.polimi.it/matteucc/Clustering/tutorial_html/kmeans.html, Retrieved: February 15, 2016
[6]Weighted average. Available at: https://www.mathsisfun.com, Retrieved: February 15, 2016
[7]A. Khedr, Seddawy, and A. Idrees “Performance Tuning of K-Mean Clustering Algorithm a Step towards Efficient DSS”, International Journal of Innovative Research in Computer Science & Technology (IJIRCST), ISSN: 2347-5552, Volume 2, Issue 6, pp.111-118 November, 2014
[8]Teknomo, K. PhD, Teknomo, K-Means Clustering Tutorial K-Means Clustering Tutorials. (2013)
[9]http:\\people.revoledu.com\kardi\ tutorial\kMean: Retrieved: February 15, 2016
[10]K-means Clustering algorithm- Data Clustering Algorithms, (sites.google.com/site/dataclusteingalgorithms/k-means clustering-algorithm k-means) Retrieved: February 28, 2016
[11]N.Aggarwal, K. Aggarwal, and K.Gupta, “Comparative Analysis of K-means and Enhanced K-means clustering algorithm for data mining”, International Journal of Scientific and Engineering Research (IJSER) ISSN 2229 -5518, Volume 3, Issue 3, pp.1-8, August 2012
[12]M. Yedla ,S.Pathakota, and T. Srinivasa “Enhancing K-means Clustering Algorithm with Improved Initial Center”, International Journal of Computer Science and Information Technologies(IJCSIT), Volume 1 (2), pp. 121-125, 2010
[13]S.K. Ali, Z.N. Azeez, A.A Ouda “A New Clustering Algorithm for Face Classification”, International Journal of Information Technology and Computer Science(IJITCS), 2016,6, 1-8, Published Online June 2016 http://www.mecs-press.org, pp 1-8, DOI:10.5815/ijitcs 2016.06.01
[14]M.H.Shovon, and M.Haque “An Approach of Improving Academic Performance by using K-means clustering Algorithm and Decision Tree”, International Journal of Advanced Computer Science and Applications(IJACSA)Vol.3, No. 8, pp.146-149, 2012
[15]Depreciation: Definition Available at: www.investorwords.com/1416/depreciation.html, Retrieved: June 5, 2016
[16]S.G. Rao, and A. Govardhan “Evaluation of H-and G- Indices of Scientific Authors using Modified K-means Clustering Algorithm”, International Journal of Information Technology and Computer Science (IJITCS) 2016,2, 47-51, pp 47-51 Published Online February 2016 http://www.mecs-press.org DOI:10.5815/ijitcs.2016.02.06

International Journal of Information Technology and Computer Science (IJITCS)