Modify Initialization k-means Clustering Algorithm to Generate Initial Centroids

Authors

  • Lamia AbedNoor Muhammed College of Computer and Mathematics University of Al-Qadissiyah

Keywords:

centroids, clustering, initial centroids k-means clustering

Abstract

K-means is one of the most common clustering techniques used with numeric data. Different issues are conducted in k-means algorithm in order to reach the optimum solutions with best situations, weather producing good results or the ways used to produce the results efficiently. Initial centroids of this algorithm play important role, so the generation initial centroids attracting more work. However, this paper aims to discuss a new proposed step to improve the generation of initial centroids i.e. modification the first iteration of k-means algorithm. The experiment work of this paper would be applied with one of the famous data that is "iris", this data is suited with k-means algorithm. The experiments were tested with the origin k-means algorithm in two parameters: "execution time" and "cost function" that is represented by sum square error  SSE. The results are promise  work with this modification

Downloads

Download data is not yet available.

Downloads

Published

2017-08-14

How to Cite

AbedNoor Muhammed, L. (2017). Modify Initialization k-means Clustering Algorithm to Generate Initial Centroids. Journal of Al-Qadisiyah for Computer Science and Mathematics, 6(2), 176–185. Retrieved from https://jqcsm.qu.edu.iq/index.php/journalcm/article/view/117

Issue

Section

Math Articles