Wen Liang CHANG, Harikrishnan RAMIAH, Jeevan KANESAN, Anand Jayant KULKARN

Data clustering using seed disperser ant algorithm

Nature-inspired optimization algorithms have become popular in the past decade. They have been applied to solve various kinds of problems. Among these would be data clustering, which has become popular in data mining in recent times due to the data explosion. In the last decade, many metaheuristic algorithms have been used to obtain improved data clustering optimization for solving data mining problems. In this paper, we applied the seed disperser ant algorithm (SDAA), which mimics the evolution of an Aphaenogaster senilis ant colony, and we introduced a modi ed SDAA that is a hybrid of K-means and SDAA for solving data clustering problems. The solutions obtained for the data clustering are very promising in terms of quality of solutions and convergence speed of the algorithm.

PDF

___

[1] Chang WL, Kanesan J, Kulkarni AJ. Seed disperser ant algorithm: an evolutionary approach for optimization. In: Evostar 2015: Applications of Evolutionary Computation; 8{10 April 2015; Copenhagen, Denmark. Berlin, Germany: Springer. pp. 643-654.
[2] Cheron B, Doums C, Federici P, Monnin T. Queen replacement in the monogynous ant Aphaenogaster senilis : supernumerary queens as life insurance. Anim Behav 2009; 78: 1317-1325.
[3] Kenne M, Dejean A. Nuptial ight of Myrmicaria opaciventris (Hymenoptera: Formicidae, Myrmicinae). Sociobiology 1998; 31: 41-50.
[4] Shang YW, Qiu YH. A note on the extended Rosenbrock function. Evol Comput 2006; 14: 119-126.
[5] Liang J, Suganthan P, Deb K. Novel composition test functions for numerical global optimization. In: Proceedings of the 2005 Swarm Intelligence Symposium; 8{10 June 2005; Pasadena, California. New York, NY, USA: IEEE. pp. 68-75.
[6] Blum C, Li X. Swarm intelligence in optimization. In: Rozenberg G, Back T, Eiben AE, Kok JN, Spaink HP, editors. Natural Computing Series. Berlin, Germany: Springer, 2008. pp. 43-85.
[7] Back T. Evolutionary Algorithms in Theory and Practice. New York, NY, USA: Oxford University Press, 1996.
[8] Kennedy J, Eberhart R. Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks 1995; 27 November{1 December 1995; Perth, Australia. New York, NY, USA: IEEE. pp. 1942-1948.
[9] Tsai CY, Kao IW. Particle swarm optimization with selective particle regeneration for data clustering. Expert Syst Appl 2011; 38: 6565-6576.
[10] Kennedy J. Particle swarm optimization. In: Sammut C, Webb GI, editors. Encyclopedia of Machine Learning. Berlin, Germany: Springer, 2010. pp. 760-766.
[11] Mitchell M. An Introduction to Genetic Algorithms. Cambridge, MA, USA: MIT Press, 1998.
[12] Maulik U, Bandyopadhyay S. Genetic algorithm-based clustering technique. Pattern Recogn 2000; 33: 1455-1465.
[13] Fathian M, Amiri B. A honeybee-mating approach for cluster analysis. Int J Adv Manuf Tech 2008; 38: 809-821.
[14] Dorigo M, Birattari M. Ant colony optimization. In: Sammut C, Webb GI, editors. Encyclopedia of Machine Learning. Berlin, Germany: Springer, 2010. pp. 36-39.
[15] Krishnasamy G, Kulkarni AJ, Paramesran R. A hybrid approach for data clustering based on modi ed cohort intelligence and K-means. Expert Syst Appl 2014; 41: 6009-6016.