Skip to main content

A K-means Optimized Clustering Algorithm Based on Improved Genetic Algorithm

  • Conference paper
  • First Online:
Proceedings of 2021 Chinese Intelligent Automation Conference

Abstract

The K-means algorithm is highly sensitive to the initial clustering centers and easily get trapped in a local optimum. To avoid such problems, this paper proposes an improved crossover operator of chromosomes in the genetic algorithm, redefines the calculation method of genetic probability and the natural selection rules, introduces different individual selection mechanisms for the two adjacent generations of chromosomes, and integrates the K-means algorithm into the improved genetic algorithm. Experiment results demonstrate that the improved K-Means algorithm is better than the original genetic algorithm and K-Means algorithm in clustering performance, far better than the bisecting K-means algorithm.

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 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover 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. Shah, M., Dalal, U.D.: 3D-image restoration technique using genetic algorithm to solve blurring problems of images. J. Photogr. Sci. 62(7), 365–374 (2014)

    Google Scholar 

  2. Mantawy, A.H., Abdel- Magid, Y.L., Selim, S.Z.: Integration genetic algorithm, tabu search, and Simulated annealing for the unit commitment problem. IEEE Trans. Power Syst. 14(3), 829–836 (1999)

    Google Scholar 

  3. Mchalewicz, Z.: Genetic Algorithm +Data Structures =Evolution Programs. 2nd edn. Spring- Verlag, New York (1994)

    Google Scholar 

  4. Huang, S.C., Jiau, M.K., Lin, C.H.: A genetic-algorithm-based approach to solve carpool service problems in cloud computing. IEEE Trans. Intell. Transp. Syst. 16(1), 352–364 (2015)

    Article  Google Scholar 

  5. Sriskandarajah, C., Jardine, A., Chan, C.K.: Maintenance scheduling of rolling stock using a genetic algorithm. J. Oper. Res. Soc. (2017)

    Google Scholar 

  6. Rezaeipanah, A., Matoori, S.S., Ahmadi, G.: A hybrid algorithm for the university course timetabling problem using the improved parallel genetic algorithm and local search. Appl. Intell. (1) (2020)

    Google Scholar 

  7. Zou, D., Li, S., Kong, X., et al.: Solving the combined heat and power economic dispatch problems by an improved genetic algorithm and a new constraint handling strategy. Appl. Energy 237(MAR.1), 646–670 (2019)

    Google Scholar 

  8. Nazarinezhad, J., Dehghani, M.: A contextual-based segmentation of compact PolSAR images using Markov random field (MRF) model. Int. J. Remote Sens.1–26 (2018)

    Google Scholar 

  9. Sinha, A., et al.: A hybrid MapReduce-based k-means clustering using genetic algorithm for distributed data sets. J. Supercomput. (2018)

    Google Scholar 

  10. Yang, Y., Fan, J., Mohamed, K.: Survey of clustering validity evaluation. Appl. Res. Comput. 25(6), 1630–1632 (2008)

    Google Scholar 

  11. Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42, 21–57 (2014)

    Google Scholar 

  12. Wang, J.: A K-means clustering algorithm based on genetic algorithm. Microcomput. Its Appl. (20), 71–73

    Google Scholar 

  13. Geng, Y., Ren, J., Gi, P.Q.: Clustering study of hybrid genetic algorithm based on k-means variation operator, Comput. Eng. Appl. 47(29) (2011)

    Google Scholar 

  14. Zhang, C.K., Wang, L.J.: An improved k- mean clustering algorithm based on genetic algorithm. Comput. Eng. Appl. 48(26) (2012)

    Google Scholar 

  15. Lu, L.H., Wang, B.: An improved genetic clustering algorithm. Comput. Eng. Appl. 43(21) (2007)

    Google Scholar 

  16. http://archive.ics.uci.edu/ml/. Accessed 21 April 2019

Download references

Acknowledgments

The authors would like to thank the Editor and the anonymous referees for their helpful comments and suggestions to improve the quality of the paper. This research was supported in part by the Ministry of Education Humanities and Social Sciences Project (No.18YJAZH087), in part by the National Social Science Fund of China (No. 20BGL251).

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pu, QM., Wu, Q., Li, Q. (2022). A K-means Optimized Clustering Algorithm Based on Improved Genetic Algorithm. In: Deng, Z. (eds) Proceedings of 2021 Chinese Intelligent Automation Conference. Lecture Notes in Electrical Engineering, vol 801. Springer, Singapore. https://doi.org/10.1007/978-981-16-6372-7_16

Download citation

Publish with us

Policies and ethics