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.
CITATION STYLE
Pandey, P., & Singh, I. (2016). Comparison between Standard K-Mean Clustering and Improved K-Mean Clustering. International Journal of Computer Applications, 146(13), 39–42. https://doi.org/10.5120/ijca2016910868
Mendeley helps you to discover research relevant for your work.