COVID-19 Dataset Clustering based on K-Means and EM Algorithms

In this paper, a COVID-19 dataset is analyzed using a combination of K-Means and Expectation-Maximization (EM) algorithms to cluster the data. The purpose of this method is to gain insight into and interpret the various components of the data. The study focuses on tracking the evolution of confirmed, death, and recovered cases from March to October 2020, using a two-dimensional dataset approach. K-Means is used to group the data into three categories: “Confirmed-Recovered”, “Confirmed-Death”, and “Recovered-Death”, and each category is modeled using a bivariate Gaussian density. The optimal value for k, which represents the number of groups, is determined using the Elbow method. The results indicate that the clusters generated by K-Means provide limited information, whereas the EM algorithm reveals the correlation between “Confirmed-Recovered”, “Confirmed-Death”, and “Recovered-Death”. The advantages of using the EM algorithm include stability in computation and improved clustering through the Gaussian Mixture Model (GMM).

@article{Boutazart2023,
  title     = {COVID-19 Dataset Clustering based on K-Means and EM Algorithms},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {14},
  number    = {3},
  year      = {2023},
  publisher = {The Science and Information Organization},
  author    = {Youssef Boutazart and Hassan Satori and Anselme R. Affane M and Mohamed Hamidi and Khaled Satori},
  doi       = {10.14569/IJACSA.2023.01403105},
  url       = {https://doi.org/10.14569/IJACSA.2023.01403105}
}