Claim Missing Document
Check
Articles

Found 1 Documents
Search

PROVINCIAL CLUSTERING BASED ON EDUCATION INDICATORS: K-MEDOIDS APPLICATION AND K-MEDOIDS OUTLIER HANDLING Rahmawati, Octavia; Fauzan, Achmad
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 18 No 2 (2024): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol18iss2pp1167-1178

Abstract

K-Medoids is a clustering algorithm that is often used because of its robustness against outliers. In this research, the focus is to cluster provinces based on educational level through several assessment indicators. This is in line with improving the quality of education in point 4 of the National Sustainable Development Goals (SDGs), namely "Quality Education". One of the points of the National Sustainable Development Goals (SDGs) that will still be improved is "Quality Education" which is the 4th point. This is because the success of a country is determined by the quality of good education. The condition of education in Indonesia still overlaps, so it is necessary to do equal distribution of education through clustering. The purpose of this research is to provide the best cluster results according to the Silhouette Index, which then the results of the clustering can be used as a consideration for advancing education in areas that still need attention, through policies or programs that can be developed by educational observers. This research was conducted in 34 provinces in Indonesia. The data source is from Statistical Publications by BPS RI. The method used is K-Medoids, because in this study there were outliers found. In addition to natural K-Medoids, the researcher also wants to compare methods by implementing K-Medoids with outlier handling in the form of imputed mean values and K-Medoids with imputed min-max values. The Silhouette Index results and cluster formation for the three comparators were 0.24 with 2 clusters, 0.26 with 8 clusters and 0.25 with 9 clusters, respectively. What differentiates this research from previous research is the type of outlier handling. Generally, K-Medoids are very indifferent to the existence of outliers. K-medoids is a widely recognized and straightforward clustering approach. Nevertheless, the algorithm's effectiveness might occasionally decline as a result of local outliers and the random selection of beginning medoids