Development of Spectral Clustering Algorithm in Cognitive Diagnosis Model: Approach for Student’s Psychological Growth

Abstract With the development of intelligent education, the diagnostic performance of the traditional cognitive diagnostic model has been unable to meet the needs of today’s education. This study uses the Gaussian mixture model (GMM) to model and optimize model parameters through maximum probability...

Full description

Saved in:
Bibliographic Details
Main Author: Xiao Chang
Format: Article
Language:English
Published: Springer 2025-08-01
Series:International Journal of Computational Intelligence Systems
Subjects:
Online Access:https://doi.org/10.1007/s44196-025-00849-w
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Abstract With the development of intelligent education, the diagnostic performance of the traditional cognitive diagnostic model has been unable to meet the needs of today’s education. This study uses the Gaussian mixture model (GMM) to model and optimize model parameters through maximum probability estimation. The spectral clustering (SC) algorithm iterative optimization was combined with a similarity matrix and Laplacian matrix to construct an improved spectral clustering cognitive diagnosis model. The proposed SC algorithm’s clustering accuracy was 0.95, ARI was 0.86, and FMI was 0.85, and its clustering performance was better than that of other comparison algorithms. The cognitive diagnosis model based on the SC algorithm showed 4.01 SC, and the psychological status score was 3.97. The clustering performance of the model proposed in this study showed a favorable outcome. Moreover, the cognitive diagnosis model based on SC can meet the cognitive diagnosis needs of most students and help improve their cognitive ability. The enhanced cognitive diagnostic model combining SC and the GMM proposed has significant advantages in clustering performance and educational application effects, providing technical support for promoting students’ psychological growth.
ISSN:1875-6883