Silhouette Density Canopy K-Means for Mapping the Quality of Education Based on the Results of the 2019 National Exam in Banyumas Regency

Ridho Ananda(1*),

(1) Institut Teknologi Telkom Purwokerto
(*) Corresponding Author
DOI: https://doi.org/10.23917/khif.v5i2.8375

Abstract

Mapping the quality of education units is needed by stakeholders in education. To do this, clustering is considered as one of the methods that can be applied. K-means is a popular algorithm in the clustering method. In its process, K-means requires initial centroids randomly. Some scientists have proposed algorithms to determine the number of initial centroids and their location, one of which is density canopy (DC) algorithm. In the process, DC forms centroids based on the number of neighbors. This study proposes additional Silhouette criteria for DC algorithm. The development of DC is called Silhouette Density Canopy (SDC). SDC K-means (SDCKM) is applied to map the quality of education units and is compared with DC K-means (DCKM) and K-means (KM). The data used in this study originated from the 2019 senior high school national examination dataset of natural science, social science, and language programs in the Banyumas Regency. The results of the study revealed that clustering through SDKCM was better than DCKM and KM, but it took more time in the process. Mapping the quality of education with SDKCM formed three clusters for social science and natural science datasets and two clusters for language program dataset. Schools included in cluster 2 had a better quality of education compared to other schools.

Keywords

Density canopy; K-means; Quality mapping; Silhouette

Full Text:

PDF

References

Badan Standar Nasional Indonesia, “Prosedur operasional standar (POS) penyelenggaraan ujian nasional tahun pelajaran 2018/2019,” BNSP, indonesia, 2018.

Badan Standar Nasional Indonesia, “Prosedur operasi standar ujian nasional sekolah menengah pertama, madrasah tsanawiyah, sekolah menengah pertama luar biasa, sekolah menengah atas, madrasah aliyah, sekolah menengah atas luar biasa, dan sekolah menengah kejuruan tahun pelajaran 2010/2011,” BNSP, Indonesia, 2011.

A. Asra, Rudiansyah, Statistika terapan untuk pembuat kebijakan dan pengambil keputusan, 2nd Ed, In Media, 2014.

A. J. Jain, “Data clustering: 50 years beyond k-means”, in the 19th International Conference on Pattern Recognition, 1967.

J. B. MacQueen,” Some Methods for Classification of High Dimensional Data Sets with Application to Reference Matching”, in Proceeding of 5th Berkeley Symposium on Mathematical Statistics and Probability, 1967.

D. S. Wardiani, N. Merlina, “Implementasi data mining untuk mengetahui manfaat RPTRA menggunakan metode k-means clustering,” Jurnal PILAR Nusa Mandiri, vol. 15, no. 1, pp. 125-132, 2019.

A. A. Hassan, W. M. Shah, A. M. Husein, M. S. Talib, A. A. J. Mohammed, M. F. Iskandar, “Clustering approach in wireless sensor networks based on k-means: limitations and recommendations,” IJRTE,vol. 7, no. 6S5, pp. 119-126, 2019.

U. Yelipe, S. Porika, M. Golla, “An Efficient Approach for Imputation and Classification of Medical Data Values Using Class-Based Clustering of Medical Records,” Computers and Electrical Engineering, vol. 66, pp. 487-504, 2018.

Mardalius, “Implementasi algoritma k-means clustering untuk menentukan kelas kelompok bimbingan belajar tambahan (Studi kasus: siswa sma negeri 1 ranah pesisir)”, in Proceding SEMILOKA ROYAL 2017 “Teknologi Mobile”, 2017.

H. Yuwafi,F. Marisa,I. D. Wijaya, “Implementasi Data Mining untuk Menentukan Santri Berprestasi di PP. Manarulhuda dengan Metode Clustering Algoritma K-means,” Jurnal SPIRIT, vol. 11, no. 1, pp. 22-29, 2019.

Y. S. Nugroho, S. N. Haryati, “Klasifikasi dan klastering penjurusan siswa sma negeri 3 boyolali,” Khazanah informatika, vol. 1, no. 1, pp. 1-6, 2015.

A. Kumar, Y. S. Ingle, A. Pande, P. Dhule, “Canopy clustering: a review on pre-clustering approach to k-means clustering,” IJIACS, vol. 3, no. 5, pp. 22-29, 2014.

J. Yoder, C. E. Priebe, “Semi-supervised K-means++,”The Journal of Statistical Computation and Simulation, 2016.

B. Fritzke, “The k-means-u* algorithm: non-local jumps and greedy retries improve k-means++ clustering[J]. 2017.

G. Zhang, C. Zhang, H. Zhang, “Improved K-means Algorithm Based on Density Canopy,” Journal Knowledge-based Systems, vol. 145, pp.289-297, 2018.

A. R. Mamat, F. S. Mohamed, M. A. Mohamed, N. M. Rawi, M. I. Awang, “Silhouette index for determining optimal k-means clustering on images in different color models,” International Journal of Engineering & Technology, vol. 7, no. 2, pp. 105-109, 2018.

R. Johnson, D. W. Wichern, Applied Multivariate Statistical Analysis, 6th Ed, New York Pearson Education, 2007.

E. Rendon, I. M. Abundez, C. Gutierrez, S. D. Zagal, A. Arizmendi, E. M. Quiroz, H. E. Arzate, “A comparison of internal and external cluster validation indexes,” in Proceeding of the 2011 American Conference on Applied Mathematics and the 5th WSEAS International Conference on Computer Engineering and Applications, 2011.

E. Rendon, I. Abudez, A. Arizmendi, E. M. Quiroz, “Internal Versus External Cluster Validation Indexes,” International Journal of Computers and Communications, vol. 5, no. 1, pp. 27-34, 2011.

L. Vendramin, R. J. G. B. Campello, E. R. Hruschka, “On the comparison of relative clustering validity criteria,” in Proceedings of the 2009 SIAM International Conference on Data Mining, 2009.

J. Baarsch, M. E. Celebi, “Investigation of Internal Validity Measures for K-means Clustering,” in Proceedings of the IMECS, 2012.

A. Saiful, J. L. Buliali,”Implementasi particle swarm optimization pada k-means untuk clustering data automatic dependent surveillance-broadcast,” Explora Informatika, pp. 30-35, 2018.

A. D. Munthe, “Penerapan clustering time series untuk menggerombolkan provinsi di Indonesia berdasarkan nilai produksi padi,” Jurnal Litbang Sukowati, vol. 2, no. 2, pp. 1-11, 2019.

Suprihatin, Y. R. W. Utami, D. Nugroho, “K-Means clustering untuk pemetaan daerah rawan demam berdarah,” Jurnal TIKomSIN, vol. 7, no. 1, pp. 8-16, 20019.

Article Metrics

Abstract view(s): 710 time(s)
PDF: 452 time(s)

Refbacks