Global K-Means (GKM) Clustering Algorithm: A Survey

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. the randomly chosen sets. Every run should be initialized using the K final centroid locations from one of the run of 10 subsets. The K center location that we get from this run will be used to initialize the K-means algorithm for the complete data set. The Global K-Means algorithm (The GKM algorithm) (2) is the incremental approach of clustering. We can dynamically add one cluster center at a time using deterministic global search procedure from suitable initial positions. It is consists of N (Where N is the size of the dataset) executions of K- means algorithm. Experimental results of the algorithm show that GKM algorithm considerably out performs the K-means algorithms.

[1]  Paul S. Bradley,et al.  Refining Initial Points for K-Means Clustering , 1998, ICML.

[2]  Aristidis Likas,et al.  The global kernel k-means clustering algorithm , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[3]  Xiaodong Liu,et al.  The Global k-Means Clustering Analysis Based on Multi-Granulations Nearness Neighborhood , 2013, Mathematics in Computer Science.

[4]  Parvesh Kumar,et al.  Analysis of X-means and global k-means USING TUMOR classification , 2010, 2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE).

[5]  Shuai Jiang,et al.  A Simple and Fast Algorithm for Global K-means Clustering , 2010, 2010 Second International Workshop on Education Technology and Computer Science.

[6]  Anil K. Jain,et al.  Data clustering: a review , 1999, CSUR.

[7]  Chu Kiong Loo,et al.  A Global k-means Approach for Autonomous Cluster Initialization of Probabilistic Neural Network , 2008, Informatica.

[8]  Adil M. Bagirov,et al.  Modified global k-means algorithm for minimum sum-of-squares clustering problems , 2008, Pattern Recognit..

[9]  Guan Yong,et al.  Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm , 2010, 2010 Third International Symposium on Intelligent Information Technology and Security Informatics.

[10]  Adil M. Bagirov,et al.  Fast modified global k-means algorithm for incremental cluster construction , 2011, Pattern Recognit..

[11]  Jim Z. C. Lai,et al.  Fast global k-means clustering using cluster membership and inequality , 2010, Pattern Recognit..

[12]  Nikos A. Vlassis,et al.  The global k-means clustering algorithm , 2003, Pattern Recognit..

[13]  Pedro Larrañaga,et al.  An empirical comparison of four initialization methods for the K-Means algorithm , 1999, Pattern Recognit. Lett..

[14]  A. Bagirov,et al.  Modified global k-means algorithm for clustering in gene expression data sets , 2006 .

[15]  Jiye Liang,et al.  Fast global k-means clustering based on local geometrical information , 2013, Inf. Sci..