Skip to main content

Genetic Algorithm-Based Optimization of Clustering Data Points by Propagating Probabilities

  • Conference paper
  • First Online:
Computational Intelligence and Machine Learning

Abstract

Clustering is among the pivotal elementary operations in the field of data analysis. The efficiency of a clustering algorithm depends on a variety of factors like initialization of cluster centers, shape of clusters, density of the dataset, and complexity of the clustering mechanism. Previous work in clustering has managed to achieve great results but at the expense of a trial and error approach to achieve optimal values for user-defined parameters which have a huge bearing on the quality of the clusters formed. In this work, we propose a solution that optimizes the user-defined parameters for clustering algorithm called Probability Propagation (PP) by harnessing the capabilities of Genetic Algorithm (GA). In order to overcome this sensitivity in PP, a novel optimization technique is applied by obtaining the optimal values of \(\delta \) and s using GA by maximizing inter-cluster spread and minimizing intra-cluster spread among the clusters being formed. The proposed method was found to retrieve top chromosomes (bandwidth and s) with a similar number of clusters, thus eliminating the sensitivity of user-defined parameters which is optimized by usingĀ GA.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Gana, G., Zhangb, Y., Dey, D.K.: Clustering by propagating probabilities between data points. Appl. Soft Comput. 41, (2016)

    Google ScholarĀ 

  2. Frey, B.J., Dueck, D.: Clustering by passing messages between data points. Science 315 (2007). www.sciencemag.org

  3. van Dongen, S.: Graph clustering via a discrete uncoupling process? SIAM J. Matrix Anal. Appl. 30(1), 121ā€“141 (2008)

    Google ScholarĀ 

  4. Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. KDD (1996)

    Google ScholarĀ 

  5. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley (1989)

    Google ScholarĀ 

  6. Liu, Y., Ye, M., Peng, J., Wu, H.: Finding the optimal number of clusters using genetic algorithms. In: IEEE Conference on Cybernetics and Intelligent Systems. Chengdu, pp. 1325ā€“1330 (2008)

    Google ScholarĀ 

  7. Bandyopadhyay, S., Maulik, U.: Nonparametric genetic clustering: comparison of validity indices. IEEE Trans. Syst. Man Cybern. Part C: Appl. Rev. 31(1), 120ā€“125 (2001)

    Google ScholarĀ 

  8. Bandyopadhyay, S., Maulik, U.: Genetic clustering for automatic evolution of clusters and application to image classification. Pattern Recogn. 35(6), 1197ā€“1208 (2002)

    Google ScholarĀ 

  9. Lai, C.C.: A novel clustering approach using hierarchical genetic algorithms. Intell. Autom. Soft Comput. 11(3), 143ā€“153 (2005)

    Google ScholarĀ 

  10. Kumsawat, P., Attakitmongcol, K., Srikaew, A.: A new approach for optimization in image watermarking by using genetic algorithms. IEEE Trans. Signal Process. 53(12), 4707ā€“4719 (2005)

    Google ScholarĀ 

  11. Ramasubramanian, P., Kannan, A.: A genetic-algorithm based neural network short-term forecasting framework for database intrusion prediction system. Soft Comput. 10(8), 699ā€“714 (2006)

    Google ScholarĀ 

  12. Chang, Y.C., Chen, S.M.: A new query reweighting method for document retrieval based on genetic algorithms. IEEE Trans. Evol. Comput. 10(5), 617ā€“622 (2006)

    Google ScholarĀ 

  13. Lin, H.J., Yang, F.W., Kao, Y.T.: An efficient GA-based clustering technique. Tamkang J. Sci. Eng. 8(2), 113ā€“122 (2005)

    Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to T. S. Ashwin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2021 The Editor(s) (if applicable) and 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

Dalmia, S., Sriram, A., Ashwin, T.S. (2021). Genetic Algorithm-Based Optimization of Clustering Data Points by Propagating Probabilities. In: Mandal, J.K., Mukherjee, I., Bakshi, S., Chatterji, S., Sa, P.K. (eds) Computational Intelligence and Machine Learning. Advances in Intelligent Systems and Computing, vol 1276. Springer, Singapore. https://doi.org/10.1007/978-981-15-8610-1_2

Download citation

Publish with us

Policies and ethics