Journal of Information Processing Systems

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

An Improved Cat Swarm Optimization Algorithm Based on Opposition-Based Learning and Cauchy Operator for Clustering

  • Kumar, Yugal (Dept. of Computer Science and Engineering, Birla Institute of Technology) ;
  • Sahoo, Gadadhar (Dept. of Computer Science and Engineering, Birla Institute of Technology)
  • Received : 2014.02.05
  • Accepted : 2015.03.30
  • Published : 2017.08.31
Download PDF
⟨ Previous Next ⟩

Abstract

Clustering is a NP-hard problem that is used to find the relationship between patterns in a given set of patterns. It is an unsupervised technique that is applied to obtain the optimal cluster centers, especially in partitioned based clustering algorithms. On the other hand, cat swarm optimization (CSO) is a new meta-heuristic algorithm that has been applied to solve various optimization problems and it provides better results in comparison to other similar types of algorithms. However, this algorithm suffers from diversity and local optima problems. To overcome these problems, we are proposing an improved version of the CSO algorithm by using opposition-based learning and the Cauchy mutation operator. We applied the opposition-based learning method to enhance the diversity of the CSO algorithm and we used the Cauchy mutation operator to prevent the CSO algorithm from trapping in local optima. The performance of our proposed algorithm was tested with several artificial and real datasets and compared with existing methods like K-means, particle swarm optimization, and CSO. The experimental results show the applicability of our proposed method.

Keywords

References

  1. J. MacQueen, "On convergence of k-means and partitions with minimum average variance," Annals of Mathematical Statistics, vol. 36, no. 3, p. 1084, 1965.
  2. S. Z. Selim and M. A. Ismail, "K-means-type algorithms: a generalized convergence theorem and characterization of local optimality," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 1, pp. 81-87, 1984.
  3. A. K. Jain, "Data clustering: 50 years beyond K-means," Pattern Recognition Letters, vol. 31, no. 8, pp. 651-666, 2010. https://doi.org/10.1016/j.patrec.2009.09.011
  4. C. A. Murthy and N. Chowdhury, "In search of optimal clusters using genetic algorithms," Pattern Recognition Letters, vol. 17, no. 8, pp. 825-832, 1996. https://doi.org/10.1016/0167-8655(96)00043-8
  5. L. Y. Tseng and S. B. Yang, "A genetic approach to the automatic clustering problem," Pattern Recognition, vol. 34, no. 2, pp. 415-424. 2001. https://doi.org/10.1016/S0031-3203(00)00005-4
  6. D. W. Van der Merwe and A. P. Engelbrecht, "Data clustering using particle swarm optimization," in Proceedings of the 2003 Congress on Evolutionary Computation (CEC'03), Canberra, Australia, 2003, pp. 215-220.
  7. 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. https://doi.org/10.1016/j.aca.2003.12.032
  8. S. C. Satapathy and A. Naik, "Data clustering based on teaching-learning-based optimization," in Swarm, Evolutionary, and Memetic Computing. Heidelberg: Springer, 2011, pp. 148-156.
  9. Y. Kumar and G. Sahoo, "A charged system search approach for data clustering," Progress in Artificial Intelligence, vol. 2, no. 2-3, pp. 153-166, 2014. https://doi.org/10.1007/s13748-014-0049-2
  10. Y. Kumar and G. Sahoo, "A chaotic charged system search approach for data clustering," Informatica, vol. 38, no. 3, pp. 249-261, 2014.
  11. D. Karaboga and C. Ozturk, "A novel clustering approach: Artificial Bee Colony (ABC) algorithm," Applied Soft Computing, vol. 11, no. 1, pp. 652-657, 2011. https://doi.org/10.1016/j.asoc.2009.12.025
  12. K. S. Al-Sultan, "A tabu search approach to the clustering problem," Pattern Recognition, vol. 28, no. 9, pp. 1443-1451, 1995. https://doi.org/10.1016/0031-3203(95)00022-R
  13. K. Krishna and M. N. Murty, "Genetic K-means algorithm," IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 29, no. 3, pp. 433-439, 1999. https://doi.org/10.1109/3477.764879
  14. Y. T. Kao, E. Zahara, and I. W. Kao, "A hybridized approach to data clustering," Expert Systems with Applications, vol. 34, no. 3, pp. 1754-1762, 2008. https://doi.org/10.1016/j.eswa.2007.01.028
  15. S. Rana, S. Jasola, and R. Kumar, "A review on particle swarm optimization algorithms and their applications to data clustering," Artificial Intelligence Review, vol. 35, no. 3, pp. 211-222, 2011. https://doi.org/10.1007/s10462-010-9191-9
  16. C. Y. Tsai and I. W. Kao, "Particle swarm optimization with selective particle regeneration for data clustering," Expert Systems with Applications, vol. 38, no. 6, pp. 6565-6576, 2011. https://doi.org/10.1016/j.eswa.2010.11.082
  17. C. Zhang, D. Ouyang, and J. Ning, "An artificial bee colony approach for clustering," Expert Systems with Applications, vol. 37, no. 7, pp. 4761-4767, 2010. https://doi.org/10.1016/j.eswa.2009.11.003
  18. X. Yan, Y. Zhu, W. Zou, and L. Wang, "A new approach for data clustering using hybrid artificial bee colony algorithm," Neurocomputing, vol. 97, pp. 241-250, 2012. https://doi.org/10.1016/j.neucom.2012.04.025
  19. M. Laszlo and S. Mukherjee, "A genetic algorithm that exchanges neighboring centers for k-means clustering," Pattern Recognition Letters, vol. 28, no. 16, pp. 2359-2366, 2007. https://doi.org/10.1016/j.patrec.2007.08.006
  20. Y. Hong and S. Kwong, "To combine steady-state genetic algorithm and ensemble learning for data clustering," Pattern Recognition Letters, vol. 29, no. 9, pp. 1416-1423, 2008. https://doi.org/10.1016/j.patrec.2008.02.017
  21. A. J. Sahoo and Y. Kumar, "Modified teacher learning based optimization method for data clustering," in Advances in Signal Processing and Intelligent Recognition Systems. Heidelberg: Springer, 2014, pp. 429-437.
  22. T. Niknam and B. Amiri, "An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis," Applied Soft Computing, vol. 10, no. 1, pp. 183-197, 2010. https://doi.org/10.1016/j.asoc.2009.07.001
  23. S. C. Chu, P. W. Tsai, and J. S. Pan, "Cat swarm optimization," in PRICAI 2006: Trends in Artificial Intelligence. Heidelberg: Springer, 2006, pp. 854-858.
  24. B. Santosa and M. K. Ningrum, "Cat swarm optimization for clustering," in Proceedings of IEEE International Conference of Soft Computing and Pattern Recognition (SOCPAR'09), Malacca, Malaysia, 2009, pp. 54-59.
  25. G. Panda, P. M. Pradhan, and B. Majhi, "IIR system identification using cat swarm optimization," Expert Systems with Applications, vol. 38, no. 10, pp. 12671-12683, 2011. https://doi.org/10.1016/j.eswa.2011.04.054
  26. P. M. Pradhan and G. Panda, "Solving multiobjective problems using cat swarm optimization," Expert Systems with Applications, vol. 39, no. 3, pp. 2956-2964, 2012. https://doi.org/10.1016/j.eswa.2011.08.157
  27. Y. Kumar and G. Sahoo, "A hybridize approach for data clustering based on cat swarm optimization," International Journal of Information and Communication Technology, 2014 (accepted).
  28. P. W. Tsai, J. S. Pan, S. M. Chen, and B. Y. Liao, "Enhanced parallel cat swarm optimization based on the Taguchi method," Expert Systems with Applications, vol. 39, no. 7, pp. 6309-6319, 2012. https://doi.org/10.1016/j.eswa.2011.11.117
  29. X. Hu, R. C. Eberhart, and Y. Shi, "Swarm intelligence for permutation optimization: a case study on n-queens problem," in Proceedings of the 2003 IEEE Swarm Intelligence Symposium (SIS'03), Indianapolis, IN, 2003, pp.243-246.
  30. X. Yao, Y. Liu, and G. Lin, "Evolutionary programming made faster," IEEE Transactions on Evolutionary Computation, vol. 3, no. 2, pp. 82-102, 1999. https://doi.org/10.1109/4235.771163
  31. S. C. Chu and P. W. Tsai, "Computational intelligence based on behaviors of cats," International Journal of Innovative Computing, Information and Control, vol. 3, no. 1, pp. 163-173, 2007.
  32. H. Wang, Y. Liu, C. Li, and S. Zeng, "A hybrid particle swarm algorithm with Cauchy mutation," in Proceedings of IEEE Swarm Intelligence Symposium (SIS2007), Honolulu, HI, 2007, pp. 356-360.
  33. S. Rahnamayan, H. R. Tizhoosh, and M. M. Salama, "Opposition-based differential evolution algorithms," in Proceedings of IEEE Congress on Evolutionary Computation (CEC2006), Vancouver, Canada, 2006, pp. 2010-2017.
  34. S. Rahnamayan, H. R. Tizhoosh, and M. M. Salama, "Opposition-based differential evolution," IEEE Transaction on Evolutionary Computation, vol. 12, no. 1, pp. 64-79, 2008. https://doi.org/10.1109/TEVC.2007.894200
  35. H. Wang, H. Li, Y. Liu, C. Li, and S. Zeng, "Opposition-based particle swarm algorithm with Cauchy mutation," in Proceedings of IEEE Congress on Evolutionary Computation (CEC2007), Singapore, 2007, pp. 4750-4756.
  36. H. Wang, Z. Wu, S. Rahnamayan, Y. Liu, and M. Ventresca, "Enhancing particle swarm optimization using generalized opposition-based learning," Information Sciences, vol. 181, no. 20, pp. 4699-4714, 2011. https://doi.org/10.1016/j.ins.2011.03.016