Skip to main content

Hybrid Fuzzy C-Means Using Bat Optimization and Maxi-Min Distance Classifier

  • Conference paper
  • First Online:
Advances in Computing and Data Sciences (ICACDS 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1046))

Included in the following conference series:

Abstract

Fuzzy c-means (FCM) is a frequently used clustering method because of its efficiency, simplicity and easy implementation. Major drawbacks of FCM are sensitivity to initialization and local convergence problem. To overcome the drawbacks, the proposed method describes a hybrid FCM using Bat optimization and Maxi-min classifier. Maxi-min classifier is used to decide the count of clusters and then pass that count to randomized fuzzy c-means algorithm, which improves the performance. Bat optimization is a global optimization method used for solving many optimization problems due to its high convergence rate. Two popular datasets from kaggle are used to show the comparison between proposed technique and the fuzzy c means algorithm in terms of performance. Experiment results showing that the proposed technique is efficient and the results are encouraging.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bezdek, J.C., Ehrlich, R., Full, W.: FCM: the fuzzy c-means clustering algorithm. Comput. Geosci. 10(2–3), 191–203 (1984)

    Article  Google Scholar 

  2. Silva Filho, T.M., et al.: Hybrid methods for fuzzy clustering based on fuzzy c-means and improved particle swarm optimization. Expert Syst. Appl. 42(17–18), 6315–6328 (2015)

    Article  Google Scholar 

  3. Hathaway, R.J., Bezdek, J.C.: Local convergence of the fuzzy c-means algorithms. Pattern Recogn. 19(6), 477–480 (1986)

    Article  Google Scholar 

  4. Jayabarathi, T., Raghunathan, T., Gandomi, A.H.: The bat algorithm, variants and some practical engineering applications: a review. In: Yang, X.-S. (ed.) Nature-Inspired Algorithms and Applied Optimization. SCI, vol. 744, pp. 313–330. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-67669-2_14

    Chapter  Google Scholar 

  5. Chawla, A., et al.: Landslide susceptibility mapping in Darjeeling Himalayas, India. Adv. Civil Eng. 2018 (2018)

    Article  Google Scholar 

  6. Chawla, A., et al.: Landslide susceptibility Zonation mapping: a case study from Darjeeling District, Eastern Himalayas. India. J. Indian Soc. Remote Sens. 47, 1–15 (2019)

    Article  Google Scholar 

  7. Whitley, D.: A genetic algorithm tutorial. Stat. Comput. 4(2), 65–85 (1994)

    Article  Google Scholar 

  8. Kirkpatrick, S., Daniel Gelatt, C., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  9. Shen, Y., Shi, H., Zhang, J.Q.: Improvement and optimization of a fuzzy c-means clustering algorithm. In: Proceedings of the 18th IEEE Instrumentation and Measurement Technology Conference, IMTC 2001. Rediscovering Measurement in the Age of Informatics (Cat. No. 01CH 37188), vol. 3. IEEE (2001)

    Google Scholar 

  10. Izakian, H., Abraham, A., Snášel, V.: Fuzzy clustering using hybrid fuzzy c-means and fuzzy particle swarm optimization. In: 2009 World Congress on Nature and Biologically Inspired Computing (NaBIC). IEEE (2009)

    Google Scholar 

  11. Wang, J., et al.: Evaluate clustering performance and computational efficiency for PSO based fuzzy clustering methods in processing big imbalanced data. In: 2017 IEEE International Conference on Communications (ICC). IEEE (2017)

    Google Scholar 

  12. Li, L., Liu, X., Xu, M.: A novel fuzzy clustering based on particle swarm optimization. In: 2007 First IEEE International Symposium on Information Technologies and Applications in Education. IEEE (2007)

    Google Scholar 

  13. Wang, Z.: Comparison of four kinds of fuzzy c-means clustering methods. In: 2010 Third International Symposium on Information Processing. IEEE (2010)

    Google Scholar 

  14. Kwok, T., Smith, K., Lozano, S., Taniar, D.: Parallel fuzzy c- means clustering for large data sets. In: Monien, B., Feldmann, R. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 365–374. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45706-2_48

    Chapter  MATH  Google Scholar 

  15. Zhou, D., et al.: Randomization in particle swarm optimization for global search ability. Expert Syst. Appl. 38(12), 15356–15364 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rajesh Dwivedi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kumar, R., Dwivedi, R., Jangam, E. (2019). Hybrid Fuzzy C-Means Using Bat Optimization and Maxi-Min Distance Classifier. In: Singh, M., Gupta, P., Tyagi, V., Flusser, J., Ören, T., Kashyap, R. (eds) Advances in Computing and Data Sciences. ICACDS 2019. Communications in Computer and Information Science, vol 1046. Springer, Singapore. https://doi.org/10.1007/978-981-13-9942-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-9942-8_7

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-9941-1

  • Online ISBN: 978-981-13-9942-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics