Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

An Efficient Cluster Centroid Initialization Method for K-Means Clustering


Affiliations
1 Sree Narayana Guru College, Coimbatore, India
     

   Subscribe/Renew Journal


Cluster analysis is one of the fundamental data analysis methods and K-Means is one of the most well-known popular clustering algorithms. The clustering result of the K-Means clustering algorithm is based on the correctness of the initial centroids, which are selected randomly. The original K-Means algorithm converges to local optimum, not the global optimum. The K-Means clustering performance can be enhanced if the initial cluster centers are found to it a series of procedure is done. Data in a cell is partitioned using a cutting plane that divides cell in two smaller cells. In this paper a new method is proposed for finding the better initial centroid and to estimate Number of Clusters based on two-cluster model which provides an efficient way of assigning the data points to suitable clusters with reduced time complexity. According to the experimental results, the proposed technique estimate the number of clusters and compute initial cluster centers for K-Means clustering. The achieved clustering results have more accuracy of clustering with less computational time when comparing to original K-Means clustering algorithm and CCIA method.


Keywords

Initial Cluster Selection, Cluster Center Initialization Algorithm (CCIA), K-Means.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 265

PDF Views: 3




  • An Efficient Cluster Centroid Initialization Method for K-Means Clustering

Abstract Views: 265  |  PDF Views: 3

Authors

E. K. Girisan
Sree Narayana Guru College, Coimbatore, India
N. Anu Thomas
Sree Narayana Guru College, Coimbatore, India

Abstract


Cluster analysis is one of the fundamental data analysis methods and K-Means is one of the most well-known popular clustering algorithms. The clustering result of the K-Means clustering algorithm is based on the correctness of the initial centroids, which are selected randomly. The original K-Means algorithm converges to local optimum, not the global optimum. The K-Means clustering performance can be enhanced if the initial cluster centers are found to it a series of procedure is done. Data in a cell is partitioned using a cutting plane that divides cell in two smaller cells. In this paper a new method is proposed for finding the better initial centroid and to estimate Number of Clusters based on two-cluster model which provides an efficient way of assigning the data points to suitable clusters with reduced time complexity. According to the experimental results, the proposed technique estimate the number of clusters and compute initial cluster centers for K-Means clustering. The achieved clustering results have more accuracy of clustering with less computational time when comparing to original K-Means clustering algorithm and CCIA method.


Keywords


Initial Cluster Selection, Cluster Center Initialization Algorithm (CCIA), K-Means.



DOI: https://doi.org/10.36039/ciitaas%2F4%2F1%2F2012%2F106918.20-25