Skip to main content

An Efficient K-Means Clustering Algorithm for Analysing COVID-19

  • Conference paper
  • First Online:
Hybrid Intelligent Systems (HIS 2020)

Abstract

COVID-19 hits the world like a storm by arising pandemic situations for most of the countries around the world. The whole world is trying to overcome this pandemic situation. A better health care quality may help a country to tackle the pandemic. Making clusters of countries with similar types of health care quality provides an insight into the quality of health care in different countries. In the area of machine learning and data science, the K-means clustering algorithm is typically used to create clusters based on similarity. In this paper, we propose an efficient K-means clustering method that determines the initial centroids of the clusters efficiently. Based on this proposed method, we have determined health care quality clusters of countries utilizing the COVID-19 datasets. Experimental results show that our proposed method reduces the number of iterations and execution time to analyze COVID-19 while comparing with the traditional k-means clustering algorithm.

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

Notes

  1. 1.

    It is one of the matrices used by Oxford COVID-19 Government Response Tracker [25]. It delivers a picture of the country’s enforced strongest measures.

References

  1. Organization WH et al.: Coronavirus disease 2019 (covid-19): situation report, 82 (2020)

    Google Scholar 

  2. Sarker, I.H., Hoque, M.M., Uddin, M.K., Alsanoosy, T.: Mobile data science and intelligent apps: concepts, AI-based modeling and research directions. Mobile Netw. Appl. 1–19 (2020)

    Google Scholar 

  3. Sarker, I.H., Kayes, A., Badsha, S., Alqahtani, H., Watters, P., Ng, A.: Cybersecurity data science: an overview from machine learning perspective. J. Big Data 7(1), 1–29 (2020)

    Article  Google Scholar 

  4. Sarker, I.H.: Context-aware rule learning from smartphone data: survey, challenges and future directions. J. Big Data 6(1), 95 (2019)

    Article  Google Scholar 

  5. Han, J., Pei, J., Kamber, M.: Data Mining: Concepts and Techniques. Elsevier, Amsterdam (2011)

    MATH  Google Scholar 

  6. Sarker, I.H., Colman, A., Kabir, M.A., Han, J.: Individualized time-series segmentation for mining mobile phone user behavior. Comput. J. 61(3), 349–368 (2018)

    Article  Google Scholar 

  7. Vattani, A.: The hardness of k-means clustering in the plane (2009). http://cseweb.ucsd.edu/avattani/papers/kmeans_hardness.pdf 617

  8. Rahim, M.S., Ahmed, T.: An initial centroid selection method based on radial and angular coordinates for k-means algorithm. In: 2017 20th International Conference of Computer and Information Technology (ICCIT), pp. 1–6. IEEE (2017)

    Google Scholar 

  9. Kumar, A., Gupta, S.C.: A new initial centroid finding method based on dissimilarity tree for k-means algorithm. arXiv preprint arXiv:1509.03200 (2015)

  10. Mahmud, M.S., Rahman, M.M., Akhtar, M.N.: Improvement of k-means clustering algorithm with better initial centroids based on weighted average. In: 2012 7th International Conference on Electrical and Computer Engineering, pp. 647–650. IEEE (2012)

    Google Scholar 

  11. Goyal, M., Kumar, S.: Improving the initial centroids of k-means clustering algorithm to generalize its applicability. J. Inst. Eng. (India) Ser. B 95(4), 345–350 (2014)

    Google Scholar 

  12. Na, S., Xumin, L., Yong, G.: Research on k-means clustering algorithm: an improved k-means clustering algorithm. In: 2010 Third International Symposium on Intelligent Information Technology and Security Informatics, pp. 63–67. IEEE (2010)

    Google Scholar 

  13. Lakshmi, M.A., Daniel, G.V., Rao, D.S.: Initial centroids for k-means using nearest neighbors and feature means. In: Soft Computing and Signal Processing, pp. 27–34. Springer (2019)

    Google Scholar 

  14. Vadyala, S.R., Betgeri, S.N., Sherer, E.A., Amritphale, A.: Prediction of the number of covid-19 confirmed cases based on k-means-LSTM. arXiv preprint arXiv:2006.14752 (2020)

  15. Poompaavai, A., Manimannan, G.: Clustering study of Indian states and union territories affected by coronavirus (COVID-19) using k-means algorithm. Int. J. Data Mining Emerg. Technol. 9(2), 43–51 (2019)

    Article  Google Scholar 

  16. Sonbhadra, S.K., Agarwal, S., Nagabhushan, P.: Target specific mining of covid-19 scholarly articles using one-class approach. arXiv preprint arXiv:2004.11706 (2020)

  17. Berkhin, P.: A survey of clustering data mining techniques. In: Grouping Multidimensional Data, pp. 25–71. Springer (2006)

    Google Scholar 

  18. Sarker, I.H., Abushark, Y.B., Khan, A.I.: ContextPCA: predicting context-aware smartphone apps usage based on machine learning techniques. Symmetry 12(4), 499 (2020)

    Article  Google Scholar 

  19. Total covid-19 tests performed by country - humanitarian data exchange. https://data.humdata.org/dataset/total-covid-19-tests-performed-by-country. Accessed 09 Mar 2020

  20. Covid-19 testing policies, Sep 3, 2020. https://ourworldindata.org/grapher/covid-19-testing-policy?region=Asia. Accessed 09 Mar 2020

  21. Uncover covid-19 challenge | kaggle. https://www.kaggle.com/roche-data-science-coalition/uncover. Accessed 09 Mar 2020

  22. Abdi, H., Williams, L.J.: Principal component analysis. Wiley Interdisc. Rev. Comput. Stat. 2(4), 433–459 (2010)

    Article  Google Scholar 

  23. Altman, D.G., Bland, J.M.: Statistics notes: quartiles, quintiles, centiles, and other quantiles. BMJ 309(6960), 996–996 (1994)

    Article  Google Scholar 

  24. Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. Technical report, Stanford (2006)

    Google Scholar 

  25. Coronavirus government response tracker | blavatnik school of government. https://www.bsg.ox.ac.uk/research/research-projects/coronavirus-government-response-tracker. Accessed 09 June 2020

  26. Kodinariya, T.M., Makwana, P.R.: Review on determining number of cluster in k-means clustering. Int. J. 1(6), 90–95 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Iqbal H. Sarker .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zubair, M., Asif Iqbal, M., Shil, A., Haque, E., Moshiul Hoque, M., Sarker, I.H. (2021). An Efficient K-Means Clustering Algorithm for Analysing COVID-19. In: Abraham, A., Hanne, T., Castillo, O., Gandhi, N., Nogueira Rios, T., Hong, TP. (eds) Hybrid Intelligent Systems. HIS 2020. Advances in Intelligent Systems and Computing, vol 1375. Springer, Cham. https://doi.org/10.1007/978-3-030-73050-5_43

Download citation

Publish with us

Policies and ethics