Graph degree linkage clustering for identify student’s performance on Kompetisi Sains Madrasah in Indonesia

Graph degree linkage (GDL) algorithm is a development of agglomerative clustering and graph. The clustering algorithm can be applied to various problems, such as student performance. Kompetisi Sains Madrasah (KSM) is one of the competitions by integrating science and Islam held in Indonesia. The final score of the competition will be used in this study to identify the students’ performance who participate in the competition. The main goal of the study is obtaining the results of the participant’s performance clusters based on the final score of KSM and obtain the information about the quality of students in schools that are participating in the competition. Based on the research, we obtain the best K-neighborhood value of three clusters is equal to 25. The research obtains the silhouette coefficient value for clustering evaluation. They are 0.5104, 0.4838, 0.6853, 0.5943, 0.6605, 0.8037, 0.6455, 0.6723, 0.6996, 0.5767, and 0.6695 in mathematics, natural science, mathematics, natural science, social science, mathematics, biology, physic, chemistry, economics, and geography subjects. The identification of school student performance in each subject tested shows that State Islamic School student performance in KSM has the best performance in elementary and middle-high grade. In senior grade, the best students’ performance in KSM is from Private Islamic School.