Global K-Means (GKM) Clustering Algorithm: A Survey
Arpita Agrawal, Hitesh Gupta · International Journal of Computer Applications · 2013
K-means clustering is a popular clustering algorithm but is having some problems as initial conditions and it will fuse in local minima.A method was proposed to overcome this problem known as Global K-Means clustering algorithm (GKM).This algorithm has excellent skill to reduce the computational load without significantly affecting the solution quality.We studied GKM and its variants and presents a survey with critical analysis.We also proposed a new concept of Faster Global K-means algorithms for Streamed Data sets (FGKM-SD).FGKM-SD improves the efficiency of clustering and will take low time & storage space.