Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

PROVINCIAL CLUSTERING BASED ON EDUCATION INDICATORS: K-MEDOIDS APPLICATION AND K-MEDOIDS OUTLIER HANDLING

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 18 No. 2 (2024) · pp. 1167–1178

DOI
10.30598/barekengvol18iss2pp1167-1178
ISSN
2615-3017, 1978-7227
Published
2024-05-25
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

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

Collaboration network of the authors

22 authors · 35 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Islamic University of Indonesia
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Nahdah Ghina HandayaniIslamic University of Indonesia1
Rinaldi SjahrilAffiliation unknown1
A. Sri Sartika Sufiina AhmadAffiliation unknown1
Herlinda YanasariAffiliation unknown1
Muh. Yunus SuriaAffiliation unknown1
Nur Qadri FebriantiAffiliation unknown1
Nur FaizinAffiliation unknown1
Arum Handini PrimandariAffiliation unknown1
Muhammad BariklanaAffiliation unknown1
Nanda Lailatul HumairahAffiliation unknown1
Ashabul Akbar MaulanaAffiliation unknown1
Alfa YulianaAffiliation unknown1
Fitri AmaliaAffiliation unknown1
Nabila Dwi FaziraAffiliation unknown1
IKA MEIZA MAHARANIAffiliation unknown1
Mega Luna SuliztiaAffiliation unknown1
Malecita Nur Atala SinggihAffiliation unknown1
Shazia Ayesha AzzahraAffiliation unknown1
Wiranti Nugrah AndiniAffiliation unknown1
Irwan SutisnaAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, first harvested 5 Nov 2026, last seen 5 Nov 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PROVINCIAL CLUSTERING BASED ON EDUCATION INDICATORS: K-MEDOIDS APPLICATION AND K-MEDOIDS OUTLIER HANDLING</dc:title>
	<dc:creator>Rahmawati, Octavia</dc:creator>
	<dc:creator>Fauzan, Achmad</dc:creator>
	<dc:description xml:lang="en-US">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</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-05-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/12081</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss2pp1167-1178</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 18 No 2 (2024): BAREKENG: Journal of Mathematics and Its Application; 1167-1178</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol18iss2year2024</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/12081/7930</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Octavia Rahmawati, Achmad Fauzan</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>