Comparative Study of Clustering Algorithms for Student Performance Evaluation
Year: 2025
Type: article
Abstract: Predicting student performance is essential for enhancing educational outcomes, enabling educators to identify studentswho may need additional support or intervention. Clustering algorithms, as unsupervised data mining techniques, areparticularly effective at uncovering patterns in student performance data. These algorithms can group students basedon their exam scores, providing insights that allow for more tailored and targeted educational strategies. This studycompares four unsupervised methods K-Means, DBSCAN, Hierarchical Clustering (Ward linkage), and GaussianMixture Models (GMM) on a dataset of 200 students’ scores across five exam questions. After standardizing the data,we project it into two dimensions via Principal Component Analysis (PCA) for visualization. We then evaluate eachmodel using three validation metrics: Silhouette Score, Davies-Bouldin Index, and Calinski-Harabasz Index. K-Meanswith k = 5 achieves the highest Silhouette (0.387) and Calinski-Harabasz (90.156) scores and the lowest DaviesBouldin Index (0.883), outperforming alternatives in both visual separation and quantitative metrics. DBSCANidentifies noise but yields overlapping clusters; Hierarchical clustering shows moderate cohesion; GMM producessofter boundaries. Our results demonstrate that K-Means offers the most interpretable and robust grouping for thiseducational dataset, providing a practical tool for segmenting students into performance tiers. Future work may exploredynamic k-selection methods, incorporation of additional student features, and deployment in intelligent tutoringsystems.
Authors: Karim Md Razaul, Cheng Zekai
Language: English
Subfield: Computer Science Applications
Field: Computer Science
Domain: Physical Sciences
SDG: Quality education
Open Access status: hybrid
OpenAlex ID: W6893285032
FWCI:
Cites:
Cited by:
Related to: