International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 146 - Issue 13 |
Published: Jul 2016 |
Authors: Pooja Pandey, Ishpreet Singh |
![]() |
Pooja Pandey, Ishpreet Singh . Comparison between Standard K-Mean Clustering and Improved K-Mean Clustering. International Journal of Computer Applications. 146, 13 (Jul 2016), 39-42. DOI=10.5120/ijca2016910868
@article{ 10.5120/ijca2016910868, author = { Pooja Pandey,Ishpreet Singh }, title = { Comparison between Standard K-Mean Clustering and Improved K-Mean Clustering }, journal = { International Journal of Computer Applications }, year = { 2016 }, volume = { 146 }, number = { 13 }, pages = { 39-42 }, doi = { 10.5120/ijca2016910868 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2016 %A Pooja Pandey %A Ishpreet Singh %T Comparison between Standard K-Mean Clustering and Improved K-Mean Clustering%T %J International Journal of Computer Applications %V 146 %N 13 %P 39-42 %R 10.5120/ijca2016910868 %I Foundation of Computer Science (FCS), NY, USA
Clustering in data mining is very important to discover distribution patterns and this importance tends to increase as the amount of data grows. It is one of the main analytical methods in data mining and its method influences its results directly. K-means is a typical clustering algorithm[3]. It mainly consists of two phases i.e. initializing random clusters and to find the nearest neighbour. Both phases have some shortcomings which are discussed in the paper and two methods are purposed based on that. First one is about how to generate the centroids and the second one will reduce the time while calculating distance from centroid.