Nothing Special   »   [go: up one dir, main page]

Skip to main content

Moth Swarm Algorithm for Clustering Analysis

  • Conference paper
  • First Online:
Intelligent Computing Methodologies (ICIC 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10363))

Included in the following conference series:

Abstract

Moth Swarm Algorithm (MSA) is a new swarm intelligent algorithm, it is inspired by the moth looking for food, phototaxis and celestial navigation in the dark environment, proposed a moth search algorithm. Because the algorithm has good convergence speed and high convergence precision, it is applied in many fields. Cluster analysis, as an effective tool in data mining, has attracted widespread attention and has been developed rapidly and has been successfully applied in recent years. Among the many clustering algorithms, the K-means clustering algorithm is easy to implement, so it is widely used. However, the K-means algorithm also has the disadvantages of large computational complexity and clustering effect depending on the selection of the initial clustering center, which seriously affects the clustering effect, and the algorithm is easy to fall into the local optimum. To solve these problems, The MSA is applied to cluster analysis, the results show that the MSA not only achieves superior accuracy, but also exhibits a higher level of stability.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

References

  1. Yang, X.S.: Nature-Inspired Metaheuristic Algorithms. Luniver Press, Bristol (2010)

    Google Scholar 

  2. Holland, J.H.: Genetic algorithms. Sci. Am. 267(1), 66–72 (1992)

    Article  Google Scholar 

  3. Yang, X.S.: Firefly algorithm, stochastic test functions and design optimization. Int. J. Bio-Inspired Comput. 2(2), 78–84 (2010)

    Article  Google Scholar 

  4. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, vol. IV, pp. 1942–1948 (1995)

    Google Scholar 

  5. Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46–61 (2014)

    Article  Google Scholar 

  6. Yang, X.-S.: Flower Pollination Algorithm for Global Optimization. In: Durand-Lose, J., Jonoska, N. (eds.) UCNC 2012. LNCS, vol. 7445, pp. 240–249. Springer, Heidelberg (2012). doi:10.1007/978-3-642-32894-7_27

    Chapter  Google Scholar 

  7. Mohamed, A.A.A., Mohamed, Y.S., El-Gaafary, A.A.M., et al.: Optimal power flow using moth swarm algorithm. Electr. Power Syst. Res. 142, 190–206 (2017)

    Article  Google Scholar 

  8. Mohamed, A.A.A., El-Gaafary, A.A., Mohamed, Y.S., Hemeida, A.M.: Multi-objective states of matter search algorithm for TCSC-based smart controller design. Electr. Power Syst. Res. 140, 874–885 (2016)

    Article  Google Scholar 

  9. Hartigan, J.A.: Clustering Algorithms. Wiley, Hoboken (1975)

    MATH  Google Scholar 

  10. Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall, Inc., Upper Saddle River (1988)

    MATH  Google Scholar 

  11. Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., et al.: Advances in Knowledge Discovery and Data Mining. MIT Press, Cambridge (1996)

    Google Scholar 

  12. Mantegna, R.N.: Fast, accurate algorithm for numerical simulation of Levy stable stochastic processes. Phys. Rev. E: Stat. Nonlinear Soft Matter Phys. 49(5), 4677–4683 (1994)

    Article  Google Scholar 

  13. Mirjalili, S.: Moth-flame optimization algorithm: a novel nature-inspired heuristic paradigm. Knowl. Based Syst. 89, 228–249 (2015)

    Article  Google Scholar 

  14. Cunningham, J.P., Moore, C.J., Zalucki, M.P., West, S.A.: Learning, odour preference and flower foraging in moths. J. Exp. Biol. 207(1), 87–94 (2004)

    Article  Google Scholar 

  15. Menzel, R., Greggers, U., Hammer, M.: Functional organisation of appetitive learning and memory in a generalist pollinator, the honey bee. In: Lewis, A.C. (ed.) Insect Learning: Ecological and Evolutionary Perspectives, pp. 79–125. Chapman and Hall, London (1993). doi:10.1007/978-1-4615-2814-2_4

    Chapter  Google Scholar 

  16. Fan, R.J., Anderson, P., Hansson, B.: Behavioural analysis of olfactory conditioning in the moth Spodoptera littoralis (Boisd.) (Lepidoptera: Noctuidae). J. Exp. Biol. 200(23), 2969–2976 (1997)

    Google Scholar 

  17. Skiri, H.T., Stranden, M., Sandoz, J.C., Menzel, R., Mustaparta, H.: Associative learning of plant odorants activating the same or different receptor neurones in the moth Heliothis virescens. J. Exp. Biol. 208(4), 787–796 (2005)

    Article  Google Scholar 

  18. Cattell, R.B.: The description of personality: basic traits resolved into clusters. J. Abnorm. Soc. Psychol. 38(4), 476 (1943)

    Article  Google Scholar 

  19. Han, J.W., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, Burlington (2011)

    MATH  Google Scholar 

  20. Blake, C., Merz, C.J.: UCI Repository of Machine Learning Databases (1998). http://www.mendeley.com/research/uci-repository-of-machine-learning-databases/

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

    Article  Google Scholar 

  22. 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 

Download references

Acknowledgments

This work is supported by National Science Foundation of China under Grant Nos. 61563008, and 61463007, and Project of Guangxi Natural Science Foundation under Grant No. 2016GXNSFAA380264.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qifang Luo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Yang, X., Luo, Q., Zhang, J., Wu, X., Zhou, Y. (2017). Moth Swarm Algorithm for Clustering Analysis. In: Huang, DS., Hussain, A., Han, K., Gromiha, M. (eds) Intelligent Computing Methodologies. ICIC 2017. Lecture Notes in Computer Science(), vol 10363. Springer, Cham. https://doi.org/10.1007/978-3-319-63315-2_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-63315-2_44

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-63314-5

  • Online ISBN: 978-3-319-63315-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics