An Efficient K-Means Clustering Algorithm for Large Data

Abstract

Cluster analysis is one of the major data analysis methods for clustering the large data sets. The cluster analysis deals with the problems of organization of a collection of data objects into clusters based on some similarity. k-means is one of the most popular data partitioning algorithms that solve the well known clustering problem. Performance of the k-means clustering greatly depends upon the correctness of the initial centroids. Typically the initial centroids for the original k-means clustering are determined randomly. So, the clustering result may reach the local optimal solutions, not the global optimum. Several improvements have been proposed to improve the performance of k-means algorithm. This paper proposes an Efficient k-means algorithm for finding the better initial centroids and an efficient way for assigning data points to appropriate clusters. The proposed algorithm is tested with six bench mark datasets, which are taken from UCI machine learning data repository and found that the proposed algorithm gives better result than the existing.