Clustering students with spectral algorithm enhanced by KDtree to improve test score predictions
摘要
The rapid growth of educational technologies has generated extensive data on student performance. This study introduces an enhanced grade prediction method that groups students using spectral clustering optimized with a KD-tree. By leveraging the structural properties of educational data, our approach forms more coherent student clusters, leading to richer input features for prediction models. Evaluated on diverse datasets, the method demonstrates significant improvements over conventional techniques. The results highlight its potential to support more accurate grade prediction and contribute to personalized education.