ICTACT Journal on Soft Computing

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

MBA-IF:A New Data Clustering Method Using Modified Bat Algorithm and Levy Flight


Affiliations
1 Department of Computer Science and Engineering, Dr. Sivanthi Aditanar College of Engineering, India
     

   Subscribe/Renew Journal


Data clustering plays an important role in partitioning the large set of data objects into known/unknown number of groups or clusters so that the objects in each cluster are having high degree of similarity while objects in different clusters are dissimilar to each other. Recently a number of data clustering methods are explored by using traditional methods as well as nature inspired swarm intelligence algorithms. In this paper, a new data clustering method using modified bat algorithm is presented. The experimental results show that the proposed algorithm is suitable for data clustering in an efficient and robust way.

Keywords

Data Clustering, Bat Algorithm, Levy Flight, Global Optimization.
Subscription Login to verify subscription
User
Notifications
Font Size

  • Pang-Ning Tan, Michael Steinbach, and Vipin Kumar, “Introduction to Data Mining”, Addison-Wesley Longman Publishing Co., Inc. Boston, 2005.

  • Jiawei Han, Michelin Kamber and Jian Pei, “Data Mining Concepts and Techniques”, Morgan Kaufmann, 2011.

  • Xin-She Yang, “A New Metaheuristic Bat-Inspired Algorithm”, Nature Inspired Cooperative Strategies for Optimization, Studies in Computational Intelligence, Vol. 284, pp. 65-74, 2010.

  • Xin-She Yang, “Bat Algorithm: Literature Review and Applications”, International Journal Bio-Inspired Computation, Vol. 5, No. 3, pp. 141-149, 2013.

  • Komarasamy G and Amitabh Wahi, “An Optimized K-means Clustering Technique using Bat Algorithm”, European Journal of Scientific Research, Vol. 84, No. 2, pp. 263-273, 2012.

  • Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman and Angela Y. Wu, “An Efficient k-Means Clustering Algorithm: Analysis and Implementation”, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 24, No. 7, pp. 881-892, 2002.

  • James Kennedy, Russell C. Eberhart and Yuhui Shi, “Swarm Intelligence”, Morgan Kaufmann, 2001.

  • Xin-She Yang, “Nature-inspired Metaheuristic Algorithms”, Luniver Press, 2010.

  • R. Jensi and G. Wiselin Jiji, “A Survey on Optimization approaches to Text Document Clustering”, International Journal on Computational Science and Applications, Vol. 3, No. 6, pp. 31-44, 2013.

  • Ujjwal Malik and Sanghamitra Bandyopadhyay, “Genetic Algorithm-based Clustering Technique”, Pattern Recognition, Vol. 33, No. 9, pp. 1455-1465, 2000

  • Shokri Z. Selim and K. Al-Sultan, “A simulated annealing algorithm for the clustering problem”, Pattern Recognition, Vol. 24, No. 10, pp. 1003-1008, 1991.

  • Eberhart J and Eberhart R, “Particle Swarm Optimization”, Proceedings of the IEEE International Conference on Neural Networks, Vol. 4, pp. 1942-1948, 1995.

  • Van D.M. and A.P. Engelbrecht, “Data clustering using particle swarm optimization”, Proceedings of The Congress on Evolutionary Computation, pp. 215-220, 2003.

  • P.S. Shelokar, V.K. Jayaraman and B.D. Kulkarni, “An Ant Colony Approach for Clustering”, Analytica Chimica Acta, Vol. 509, No. 2, pp. 187-195, 2004.

  • K.N. Krishnanand and D. Ghose, “Glowworm swarm optimization for simultaneous capture of multiple local optima of multimodal functions”, Swarm Intelligence, Vol. 3, No. 2, pp. 87-124, 2009.

  • Swagatam Das, Arijit Biswas, Sambarta Dasgupta and Ajith Abraham, “Bacterial Foraging optimization Algorithm: Theoretical Foundations, Analysis, and Applications”, Foundations of Computational Intelligence, Vol. 203, pp. 23-55, 2009.

  • N.K. Jhankal and D. Adhyaru, “Bacterial foraging optimization algorithm: A derivative free technique”, Nirma University International Conference on Engineering, pp.1-4, 2011.

  • D.T. Pham and M. Castellani, “The Bees Algorithm – Modelling Foraging Behaviour to Solve Continuous Optimization Problems”, Proceedings of the Institution of Mechanical Engineers Part C: Journal of Mechanical Engineering Science, Vol. 223, No. 12, pp. 2919-2938, 2009.

  • Dervis Karaboga and Bahriye Akay, “A comparative study of Artificial Bee Colony algorithm”, Applied Mathematics and Computation, Vol. 214, No. 1, pp. 108-132, 2009.

  • Barthelemy P, Bertolotti J and Wiersma D. S, “A Levy flight for light”, Nature, Vol. 453, pp. 495-498, 2008.

  • D. Karaboga and B. Basturk, “Artificial Bee Colony (ABC) optimization algorithm for solving constrained optimization problems”, Proceedings of the 12th International Fuzzy Systems Association World Congress, Foundations of Fuzzy Logic and Soft Computing, pp. 789-798, 2007.

  • D. Simon, “Biogeography-Based Optimization”, IEEE Transactions on Evolutionary Computation, Vol. 12, No. 6, pp. 702-713, 2008.

  • Xin-She Yang and Suash Deb, “Engineering Optimisation by Cuckoo Search”, International Journal of Mathematical Modelling and Numerical Optimization, Vol. 1, No. 4, pp. 330-343, 2010.

  • Xin-She Yang and Suash Deb, “Cuckoo search via Lévy flights”, Proceedings of World Congress on Nature & Biologically Inspired Computing, pp. 210-214, 2009.

  • Szymon Lukasik and Slawomir Zak, “Firefly algorithm for continuous constrained optimization tasks”, Proceedings of the First International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems, pp. 97-100, 2009.

  • Xin-She Yang, “Firefly algorithm, stochastic test functions and design optimization”, International Journal of Bio-inspired Computation, Vol. 2, No. 2, pp. 78-84, 2010.

  • P.W. Tsai, J.S. Pan, B.Y. Liao, M.J. Tsai and V. Istanda, “Bat algorithm inspired algorithm for solving numerical optimization problems”, Applied Mechanics and Materials, Vol. 148-149, pp. 134-137, 2012.

  • Xin-She Yang, “Flower pollination algorithm for global optimization”, Proceedings of the 11th International Conference on Unconventional Computation and Natural Computation, Vol. 7445, pp. 240-249, 2012.

  • Amir Hossein Gandomi and Amir Hossein Alavi, “Krill herd: A new bio-inspired optimization algorithm”, Communications in Nonlinear Science and Numerical Simulation, Vol. 17, No. 12, pp. 4831-4845, 2012.

  • Taher Niknam, Elahe Taherian Fard, Narges Pourjafarian and Alireza Rousta, “An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering”, Engineering Applications of Artificial Intelligence, Vol. 24, No. 2, pp. 306-317, 2011.

  • Yi-Tung Kao, Erwie Zahara and I-Wei Kao, “A hybridized approach to data clustering”, Expert Systems with Applications, Vol. 34, No. 3, pp. 1754-1762, 2008.

  • Changsheng Zhang, Dantong Ouyang and Jiaxu Ning, “An artificial bee colony approach for clustering”, Expert Systems with Applications, Vol. 37, No. 7, pp. 4761-4767, 2010.

  • Tunchan Cura, “A particle swarm optimization approach to clustering”, Expert Systems with Applications, Vol. 39, No. 1, pp. 1582-1588, 2012.

  • Daniela Zaharie, “A Comparative Analysis of Crossover Variants in Differential Evolution”, Proceedings of the International Multiconference on Computer Science and Information Technology, pp. 171-181, 2007.

  • Dervis Karaboga and Celal Ozturk, “A novel clustering approach: Artificial Bee Colony (ABC) algorithm”, Applied Soft Computing, Vol. 11, No. 1, pp. 652-657, 2011.

  • Yunlong Zhu, Xiaohui Yan, Wenping Zou and Liang Wang, “A new approach for data clustering using hybrid artificial bee colony algorithm”, Neurocomputing, Vol. 97, pp. 241-250, 2012.

  • J. Senthilnath, S.N. Omkar and V. Mani, “Clustering using firefly algorithm: performance study”, Swarm and Evolutionary Computation, Vol. 1, No. 3, pp. 164-171, 2011.

  • Miao Wan, Lixiang Li, Jinghua Xiao, Cong Wang and Yixian Yang, “Data clustering using bacterial foraging optimization”, Journal of Intelligent Information Systems, Vol. 38, No. 2, pp. 321-341, 2012.

  • J. Senthilnath, Vipul Das, S.N. Omkar and V. Mani, “Clustering using Levy Flight Cuckoo Search”, Proceedings of Seventh International Conference on Bio-Inspired Computing: Theories and Applications, Advances in Intelligent Systems and Computing, Vol. 202, pp. 65-75, 2012.

  • Blake C. L. & Merz C. J, UCI repository of machine learning databases. http://www.ics.uci.edu/-mlearn/MLRepository.html, 1998.

  • ftp://ftp.ics.uci.edu/pub/machine-learning-databases/


Abstract Views: 283

PDF Views: 2




  • MBA-IF:A New Data Clustering Method Using Modified Bat Algorithm and Levy Flight

Abstract Views: 283  |  PDF Views: 2

Authors

R. Jensi
Department of Computer Science and Engineering, Dr. Sivanthi Aditanar College of Engineering, India
G. Wiselin Jiji
Department of Computer Science and Engineering, Dr. Sivanthi Aditanar College of Engineering, India

Abstract


Data clustering plays an important role in partitioning the large set of data objects into known/unknown number of groups or clusters so that the objects in each cluster are having high degree of similarity while objects in different clusters are dissimilar to each other. Recently a number of data clustering methods are explored by using traditional methods as well as nature inspired swarm intelligence algorithms. In this paper, a new data clustering method using modified bat algorithm is presented. The experimental results show that the proposed algorithm is suitable for data clustering in an efficient and robust way.

Keywords


Data Clustering, Bat Algorithm, Levy Flight, Global Optimization.

References