Optimization of K-means algorithm: Ant colony optimization

Significance of a versatile and simple clustering algorithm is becoming indispensable with the huge data growth in recent years. K-Means clustering is one such clustering algorithm which is simple yet elegant. But K-Means Algorithm has its disadvantages, dependence on the initial cluster centers and the algorithm tends to converge at a local minima. To overcome these disadvantages, ant colony optimization is applied to improve the traditional K-Means clustering algorithm. Two methods of using ants in K-Means are presented in the paper. In the first method the ant is allowed to go for a random walk and picks a data item. Pick and Drop probabilities of that particular data item are calculated. These values determine whether a data item remains in the same cluster or is moved to another cluster. In the second method instead of letting the ant pick up a data item randomly we calculate the pick and drop and let the ant walk to the data item which has the highest probability to be moved to another cluster. Entropy and F-measure are considered as quality measures.

[1]  Shokri Z. Selim,et al.  K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Sheng-Yi Jiang,et al.  An efficient clustering algorithm , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[3]  Laxman Sahoo,et al.  An Effective Clustering Algorithm for Data Mining , 2010, 2010 International Conference on Data Storage and Data Engineering.

[4]  Gao Shang.  A New Hybrid Ant Colony Algorithm for Clustering Problem , 2008, 2008 International Symposium on Intelligent Information Technology Application Workshops.

[5]  Miin-Shen Yang,et al.  Alternative c-means clustering algorithms , 2002, Pattern Recognit..

[6]  Jieming Wu,et al.  Optimization and Improvement Based on K-Means Cluster Algorithm , 2009, 2009 Second International Symposium on Knowledge Acquisition and Modeling.

[7]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[8]  Habibollah Agh Atabay,et al.  A clustering algorithm based on integration of K-Means and PSO , 2016, 2016 1st Conference on Swarm Intelligence and Evolutionary Computation (CSIEC).

[9]  Marian Cristian Mihaescu,et al.  An optimized version of the K-Means clustering algorithm , 2014, 2014 Federated Conference on Computer Science and Information Systems.

[10]  Marco Dorigo,et al.  Distributed Optimization by Ant Colonies , 1992 .

[11]  Liu Shang,et al.  The K-means clustering algorithm based on density and ant colony , 2003, International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003.