A Mid – Point based k-mean Clustering Algorithm for Data mining

Abstract

Abstract—In k-means clustering algorithm, the number of centroids is equal to the number of the clusters in which data has to be partitioned which in turn is taken as an input parameter. The initial centroids in original k-means are chosen randomly from the given dataset and for the same dataset different clustering results are produced with different randomly chosen initial centroids. This paper presents a solution to this limitation of the original K-means Algorithm. Keywords-K-means,centroids,mid-pont,clustering, computationally expensive. I.