Analisis Algoritma K-Means dalam Pengelompokkan Persebaran Covid-19 di Indonesia
نویسندگان
چکیده
Covid-19 or Coronavirus is a virus that found in humans and animals. This can infect to cause various diseases such as flu, serious Middle East Respiratory Syndrome (MERS) Severe Acute (SARS). In Indonesia, the spread of cases continues increase evenly distributed all provinces Indonesia because fairly rapid due vast area making it possible for grouping based on regions be needed which will result center points this case. study aims group data into cluster using K-Means Clustering Data Mining Algorithm. The used July 6, 2021 was taken from official website Kawal (KawalCovid-19.id). attributes are positive cases, recovered, died. clusters formed results research 3 with first consisting 2 provinces, second third 29 provinces. largest rate one. From study, accuracy 91.176% evaluated Davies-Bouldin Index yielded good value 0.493371469.
منابع مشابه
Ranking and Clustering Iranian Provinces Based on COVID-19 Spread: K-Means Cluster Analysis
Introduction: The Coronavirus has crossed geographical borders. This study was performed to rank and cluster Iranian provinces based on coronavirus disease (COVID-19) recorded cases from February 19 to March 22, 2020. Materials and Methods: This cross-sectional study was conducted in 31 provinces of Iran using the daily number of confirmed cases. Cumulative Frequency (CF) and Adjusted CF (ACF)...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملK-means vs Mini Batch K-means: A comparison
Mini Batch K-means ([11]) has been proposed as an alternative to the K-means algorithm for clustering massive datasets. The advantage of this algorithm is to reduce the computational cost by not using all the dataset each iteration but a subsample of a fixed size. This strategy reduces the number of distance computations per iteration at the cost of lower cluster quality. The purpose of this pa...
متن کاملK+ Means : An Enhancement Over K-Means Clustering Algorithm
K-means (MacQueen, 1967) [1] is one of the simplest unsupervised learning algorithms that solve the well-known clustering problem. The procedure follows a simple and easy way to classify a given data set to a predefined, say K number of clusters. Determination of K is a difficult job and it is not known that which value of K can partition the objects as per our intuition. To overcome this probl...
متن کاملk*-Means: A new generalized k-means clustering algorithm
This paper presents a generalized version of the conventional k-means clustering algorithm [Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, University of California Press, Berkeley, 1967, p. 281]. Not only is this new one applicable to ellipse-shaped data clusters without dead-unit problem, but also performs correct clustering without pre-assigning the exact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MEANS (Media Informasi Analisa dan Sistem)
سال: 2022
ISSN: ['2599-3089', '2548-6985']
DOI: https://doi.org/10.54367/means.v6i2.1372