Skip to main content

Cuckoo Search Algorithm Inspired by Artificial Bee Colony and Its Application

  • Conference paper
  • First Online:
Advances in Swarm Intelligence (ICSI 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9712))

Included in the following conference series:

  • 1736 Accesses

Abstract

Cuckoo search algorithm with advanced levy flight strategy, can greatly improve algorithm’s searching ability and increase the diversity of population. But it also has some problems. We improve them in this paper. First, in order to address the randomness of levy flight fluctuating significantly in the later and its poor convergence performance, we combine artificial bee colony algorithm with cuckoo search algorithm since artificial bee colony algorithm considers the group learning and cognitive ability, individuals learn from each other in the iterative process, which improves the local search ability of the later, and can find the optimal solution more quickly. Second, we use mutation operation to create the worst nest’s position so as to increase the diversity of the population. Then put forward the ABC-M-CS algorithm and use the thought of K-means to cluster UCI data. The experimental results on UCI data sets indicate that ABC-M-CS algorithm has the fastest convergence speed, highest accuracy and stability.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Li, R.-Y.: Clustering Analysis Algorithm in Data Mining Research and Application. Xi’an university of electronic science and technology, Xi’an (2012)

    Google Scholar 

  2. Serna, A.: Implementation of hierarchical clustering methods. J. Comput. Phy. 129(1), 30–40 (1996)

    Article  MATH  Google Scholar 

  3. Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: National Conferences on Aritificial Intelligence 1998–1999, pp. 226–231 (1998)

    Google Scholar 

  4. Ankerst, M., Breunig, M.M., Kriegel, H.-P., Sander, J.: OPTICS: ordering points to identify the clustering structure. In: Proceedings of the 1999 ACM SIGMOD International Conference on Management of data, pp. 49–60 (1999)

    Google Scholar 

  5. Guha, S., Rastogi, R., Shim, K.: ROCK: a robust clustering algorithm for categorical attributes Inform. Inf. Syst. 25(5), 345–366 (2000)

    Article  Google Scholar 

  6. Han, J., Kamber, M.: Data Mining Concepts and Techniques. Morgan Kaufmann Publishers, San Francisco (2001)

    Google Scholar 

  7. Lei, X.: Swarm Intelligent Optimization Algorithms and their Application. Science Press (in Chinese), Beijing (2012)

    Google Scholar 

  8. Niknam, T., Amiri, B.: An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis. Appl. Soft Comput. 10(1), 183–197 (2010)

    Article  Google Scholar 

  9. Selim, S.Z., Alsultan, K.: A simulated annealing algorithm for the clustering problem. Pattern Recogn. J. Pattern Recogn. Soc. 24(10), 1003–1008 (1991)

    Article  MathSciNet  Google Scholar 

  10. Van Der Merwe, D.W., Engelbrecht, A.P.: Data clustering using particle swarm optimization. In: Proceeding of 2003 Congress on Evolutionary Computation(CEC 2003), pp. 215–220 (2003)

    Google Scholar 

  11. Shelokar, P.S., Jayaraman, V.K., Kulkarni, B.D.: An ant colony approach for clustering. Anal. Chim. Acta 509(2), 187–195 (2004)

    Article  Google Scholar 

  12. Khaled, S.: Al-Sultan.: A tabu search approach to the clustering problem. Pattern Recogn. J. Pattern Recogn. Soc. 28(9), 1443–1451 (1995)

    Article  Google Scholar 

  13. Zhao, J., Lei, X., Wu, Z., Tan, Y.: Clustering using improved cuckoo search algorithm. In: Tan, Y., Shi, Y., Coello, C.A. (eds.) ICSI 2014, Part I. LNCS, vol. 8794, pp. 479–488. Springer, Heidelberg (2014)

    Google Scholar 

  14. Yang X.S., Deb, S.: Cuckoo Search via Levy flights. In: World Congress on Nature & Biologically Inspired Computing, pp. 210–214. IEEE Publication, USA (2009)

    Google Scholar 

  15. Ouaarab, A., Ahiod, B., Yang, X.-S.: Random-key cuckoo search for the travelling salesman problem. Soft Comput. 19(4), 1099–1106 (2015)

    Article  Google Scholar 

  16. Yang, X.S., Deb, S.: Engineer optimization by cuckoo search. Int. J. Math. Modeling Num. Optimization 1(4), 330–343 (2010)

    Article  MATH  Google Scholar 

  17. Afzalan, E., Joorabian, M.: An improved cuckoo search algorithm for power economic load dispatch. Int. Trans. Electr. Energy Syst. 25(6), 958–975 (2015)

    Article  Google Scholar 

  18. Wang, L.-J., Yin, Y.-L., Zhong, Y.-W.: Cuckoo Search Algorithm with Dimension by Dimension Improvement. J. Softw. 11 (2013)

    Google Scholar 

  19. Reynolds, A.M., Rhodes, C.J.: The levy flight paradigm: random search patterns and mechanism. Ecology 90, 877–887 (2009)

    Article  Google Scholar 

  20. Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459–471 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  21. Zhang, X.-G.: Pattern recognition, 3rd edn. Tsinghua university press, Beijing (1999)

    Google Scholar 

  22. Krishnasamy, G., Kulkarni, A.J., Paramesran, R.: A hybrid approach for data clustering based on modified cohort intelligence and K-means. Expert Syst. Appl. 41(13), 6009–6016 (2014)

    Article  Google Scholar 

  23. Haasanzadeh T, Meybodi M R.: A new hybrid approach for data clustering using firefly algorithm and K-means. In: International Symposium on Artificial Intelligence and Signal Processing 16th, pp. 007–011 (2012)

    Google Scholar 

  24. Cowgill, M.C., Harvey, R.J., Watson, L.T.: A genetic algorithm approach to cluster analysis. Comput. Math Appl. 37(7), 99–108 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  25. Hatamlou, A., Abdullah, S., Nezamabadi-pour, H.: A combined approach for clustering based on K-means and gravitational search algorithms. Swarm Evol. Comput. 6, 47–52 (2012)

    Article  Google Scholar 

  26. Kao, Y.-T., Zahara, E., Kao, I.-W.: A hybridized approach to data clustering. Expert Syst. Appl. 34(3), 1754–1762 (2007)

    Article  Google Scholar 

  27. Niknam, T., Fard, E.T., Pourjafarian, N., Rousta, A.: An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering. Eng. Appl. Artif. Intell. 24(2), 306–317 (2010)

    Article  Google Scholar 

Download references

Acknowledgments

This paper is supported by the National Natural Science Foundation of China (61502290, 61401263), Industrial Research Project of Science and Technology in Shaanxi Province (2015GY016), the Fundamental Research Funds for the Central Universities, Shaanxi Normal University (GK201501008), and China Postdoctoral Science Foundation (2015M582606).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiujuan Lei .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Gao, Y., Lei, X., Dai, C. (2016). Cuckoo Search Algorithm Inspired by Artificial Bee Colony and Its Application. In: Tan, Y., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2016. Lecture Notes in Computer Science(), vol 9712. Springer, Cham. https://doi.org/10.1007/978-3-319-41000-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-41000-5_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40999-3

  • Online ISBN: 978-3-319-41000-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics