Improvement Of K Means Clustering Algorithm

1431 Words Nov 23rd, 2014 6 Pages
IMPROVEMENT IN K-MEANS CLUSTERING ALGORITHM
FOR DATA CLUSTERING Omkar Acharya
Department of Computer Engineering
Pimpri Chinchwad College Of Engineering
Savitribai Phule Pune University
Pune, India omkarchamp1000@gmil.com Mayur Sharma
Department of Computer Engineering
Pimpri Chinchwad College Of Engineering
Savitribai Phule Pune University
Pune, India mayur_sharma60@yahoo.com Mahesh Kopnar
Department of Computer Engineering
Pimpri Chinchwad College Of Engineering
Savitribai Phule Pune University
Pune, India mkopnar@gmail.com Abstract— The set of objects having same characteristics are organized in groups and clusters of these objects are formed known as Data Clustering.It is an unsupervised learning technique for classification of data. K-means algorithm is widely used and famous algorithm for analysis of clusters.In this algorithm, n number of data points are divided into k clusters based on some similarity measurement criterion. K-Means Algorithm has fast speed and thus is used commonly clustering algorithm. Vector quantization,cluster analysis,feature learning are some of the application of K-Means.However results generated using this algorithm are mainly dependant on choosing initial cluster centroids.The main shortcome of this algorithm is to provide appropriate number of clusters.Provision of number of clusters before applying the algorithm is highly impractical and requires deep knowledge of clustering…
Open Document