Open AccessPENERAPAN ALGORITMA K-MEDOIDS CLUSTERING UNTUK PENGELOMPOKKAN PENYEBARAN DIARE DI KOTA MEDAN (STUDI KASUS: KANTOR DINAS KESEHATAN KOTA MEDAN)
Author(s) -
Bambang Riyanto
Publication year - 2019
Publication title -
komik (konferensi nasional teknologi informasi dan komputer)
Language(s) - English
Resource type - Journals
eISSN - 2597-4645
pISSN - 2597-4610
DOI - 10.30865/komik.v3i1.1659
Subject(s) - medoid , cluster analysis , cluster (spacecraft) , diarrhea , computer science , geography , mathematics , medicine , artificial intelligence , computer network
The health office is in charge of instructing and registering diarrhea sufferers in each region, then the area will be evaluated which areas are most affected by diarrhea. And checking directly into the field revealed that the most basic cause was about the unclean environment such as trenches that were too much garbage, causing floods during the rainy season. The health office also encourages the community to always maintain environmental cleanliness and familiarize people to always wash their hands with soap before eating and after cleaning with simple things like this is expected to help reduce diarrhea sufferers in the city of Medan. K-Medoids Clustering is clustering algorithm which is similar to K-Means. The difference between these two algorithms is the K-Medoids or PAM algorithm uses the object as a representative (medoid) as the center of the cluster for each cluster, while the K-Means uses the mean (mean) as the center of the cluster.Keywords: Diarrhea, Service office, Data mining, K-Medoids Algorithm