A novel method for selecting initial centroids in K-means clustering algorithm Online publication date: Mon, 15-Aug-2016
by S. Poomagal; P. Saranya; S. Karthik
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 15, No. 3, 2016
Abstract: In data mining, clustering is a method of grouping similar points together. This grouping can be done using partitioning or hierarchical clustering algorithms. K-means is one of the partitioning clustering algorithms which is simple and faster than other clustering algorithms. Major drawbacks of K-means algorithm are the selection of initial centroids and number of clusters (K). This paper aims at providing a solution for selecting initial centroids in which a new point is calculated at each iteration and the point in the dataset which is closest to the calculated point is selected as the centroid. The performance of the proposed work is compared with existing methods using four datasets collected from UCI repository. From the results, it is proved that the proposed work increases accuracy by 88.74% for Iris dataset, 28.18% for Breast cancer dataset, 34.03% for Seeds dataset and 18.18% for PIMA I Diabetes dataset over the other methods.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Systems Technologies and Applications (IJISTA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook