Multidimensional clustering analysis of mathematical knowledge difficulty based on Gspan

Abstract

In addition to providing learners with a large amount of teaching resources, online teaching platforms can also provide learning resources and channels such as video courseware, Q&A tutoring groups, and forums. However, currently, there are still shortcomings in depth and dimensionality in mining student learning behavior data on the platform. In view of this situation, based on the learning interaction behavior, this study established the difficulty similarity model of knowledge points, and used spectral clustering to classify their difficulty. In addition, the study intended to use the maximum frequent subgraph under the Gspan framework to characterize learners’ implicit learning patterns. The outcomes expressed that the algorithm put forward in the study achieved the highest accuracy index of 98.8%, which was 1.4%, 4.0%, and 8.6% higher than Apriori-based graph mining algorithms, K-means, and frequent subgraph discovery algorithms. In terms of F1 index, the convergence value of the algorithm proposed in the study was 95.5%, which was about 2.5% higher than the last three algorithms. In addition, learners of all three cognitive levels had the highest maximum number of frequent subgraphs with sizes above 100 when the minSup value was 60%. And when the number of clusters was 3, the clustering accuracy of the three learners was the highest. In similarity calculation, the calculation method used in the study was at the minimum in terms of root mean square error and absolute error average index, which were 0.048% and 0.01% respectively. This indicated that the model proposed by the research had better classification effect on the difficulty of knowledge points for learners of different cognitive levels, and had certain application potential.