# Exploratory Research on the Practice of College English Classroom Teaching Based on Internet and Artificial Intelligence

Authors: Yunjie Jia
Journal: Security and Communication Networks
 (2022)

---

## Abstract

With the rapid development of cloud computing and mobile Internet technology, the information of optional services in the network is exploding and the problem of information overload is becoming more and more serious. The recommendation system can recommend suitable English online classes for students according to their interests and needs, effectively reduce the data load, help students extract effective information from the mass of information, and make accurate recommendations. Aiming at the problems of data sparsity and cold start in the recommendation system, this paper proposes a recommendation method to improve the collaborative recommendation algorithm in college English online classroom teaching practice. Based on the extracted student tag feature information, this method uses spectral clustering algorithm to cluster similar students and transforms the original high-dimension scoring matrix into several lower-dimension subscoring matrices. Then, the implicit meaning model is used to locally predict the missing score in the subscore matrix. Finally, after obtaining the missing score, the improved neighborhood-based collaborative recommendation algorithm is used to predict the global score of the target student. Experiments are performed on commonly used public data sets. Compared with the traditional recommendation algorithm, the proposed algorithm has higher recommendation accuracy and better RMSE performance.


---

## Body

## 1. Introduction

In the era of “Internet plus,” students have a broad vision, are not afraid of authority, and no longer blindly accept the indoctrination of books and teachers. The penetration of the Internet, the application of artificial intelligence, and the popularity of smart phones have also changed students’ learning concepts and ways [1]. Students’ learning input is no longer limited to classroom and relying on teachers, and they can use the abundant resources of the Internet to obtain the knowledge they need [2].In today’s era of rapid scientific and technological development, all walks of life continue to reform and innovate and education industry is also subjected to the baptism of the tide of The Times, facing unprecedented challenges. With the continuous advancement of teaching reform in colleges and universities, innovative teaching methods have gradually infiltrated. Information-based classroom software platforms represented by university’s “Rain Classroom,” “Blue Ink Cloud Class,” and “UMU Interactive Learning Platform” have emerged in an endless stream [3]. How to introduce the information-based classroom teaching methods under the influence of “Internet+” thinking into traditional course teaching has become the focus of teaching reform and innovation in various disciplines.Due to the epidemic and other reasons, the demand for online teaching in universities at home and abroad has increased sharply. According to data release report, more than 2,000 colleges and universities in China have adopted online teaching tools such as Tencent Classroom and Rain Classroom for online teaching [4]. However, the Special Research Report on the Evaluation of the Effect of Online School Resumption in China in the Spring of 2020 by Imedia pointed out that the current online teaching tools in colleges and universities can only rely on teachers to recommend and release human resources and cannot integrate and utilize the teaching resources in schools automatically. Due to copyright problems, internal teaching resources can only be accessed externally by teachers and students through VPN and other ways but cannot provide good internal search and query tools. This leads to the seemingly contradictory problem of “too many idle resources on campus and insufficient demand satisfaction,” which seriously affects the effectiveness of online teaching [5]. Although a series of new mobile Internet technologies, such as knowledge recommendation engine, have provided solutions to this problem to a certain extent, the relative isolation of resources in the campus network leads to the reduced efficiency of these solutions.In recent years, the scale of student and English online courses in the network is getting larger, and the huge data information becomes rich resources, which also brings great challenges to the existing collaborative recommendation algorithm [6]. In the face of massive, multisource, heterogeneous, and sparse students’ behaviour data, the traditional neighborhood model-based collaborative recommendation algorithm [7] and the matrix factor-based latent factor model (LFM) are unable to do so. The traditional neighborhood-based collaborative recommendation model needs to mine the similarity information of students on the basis of calculating the similarity between all student pairs or English online course pairs, so as to determine the similar historical students of target students [8]. However, in the face of student comment information with high dimension, large scale, and sparse data substituted with context information, there is a huge amount of calculation and the efficiency of recommendation algorithm is one of the bottlenecks, affecting the further improvement of recommendation performance. Meanwhile, the problem of cold start is also one of the urgent problems to be solved in collaborative recommendation methods.At the psychological level, domestic and foreign scholars have concluded that the individual differences of each learning individual make personalized curriculum planning have positive significance for learning [9]. Although the personalized curriculum recommendation algorithm started late in China, there are many achievements in the optimization and improvement of recommendation algorithm. Through the collaborative prediction method of learning resources in literature [10], problems such as extensibility calculation and loose calculation in collaborative recommendation algorithm are basically alleviated. Literature [11] improves the collaborative filtering algorithm based on English online courses through communication between teachers and students. By analysing the characteristics of students, a personalized recommendation algorithm suitable for students is proposed to alleviate the problem of low fit between recommendation results and learners. Literature [12] obtained and analysed the dynamic data of online learners in the learning process, extracted the personalized learning needs of learners, and made an overall course planning through professional teachers. Finally, the genetic hierarchical recommendation algorithm was used to recommend courses for learners, significantly improving the accuracy of course recommendation.However, the above methods often involve the problem of cold start of recommendation algorithm, which makes it impossible to establish a recommendation model with good performance and accurate recommendation without initial data. This paper proposes an intelligent collaborative recommendation algorithm based on spectral clustering and cryptic model. On the basis of mining similar information between students or items using spectral clustering algorithm, the algorithm combines the recommendation model based on cryptic meaning model with the collaborative recommendation model based on neighborhood, so as to solve the bottleneck problem in the traditional collaborative recommendation algorithm and improve the recommendation performance.The contributions of this paper are as follows:(1)
On the basis of obtaining the label feature vectors of students (or English online courses), the spectral clustering algorithm is used to cluster students to obtain similar students of the target students. Meanwhile, the original scoring matrix can be divided into several lower-dimension subscoring matrices based on the spectral clustering algorithm(2)
In each subscoring matrix, the matrix decomposition model based on cryptic meaning model is used to locally predict the missing score to solve the data sparsity(3)
The improved neighborhood-based collaborative recommendation algorithm is used to predict the global score of the target studentsThis paper consists of four main parts: Section1 is the introduction, Section 2 is the state of the art, Section 3 is methodology, Section 4 is result analysis and discussion, and Section 5 is the conclusion.


## 2. State of the Art

### 2.1. Collaborative Recommendation Method Based on the Neighborhood Model

The neighborhood model-based collaborative recommendation method is mainly based on the user’s historical behavior information to find the nearest neighbors with similar preferences for the user. It is based on the idea of “people are divided into groups” or “things are clustered together” to recommend items that may be of interest to users. At present, many scholars at home and abroad have improved the basic nearest neighbor model in different degrees to improve the model recommendation effect [11, 13]. Literature [11] proposes a QoS-aware personalized service recommendation method based on users’ rating of service quality attributes of services. It finds near-neighbor objects with similar QoS preferences for users by building a region model. Literature [13] constructs a user preference model by mining user text comment data and extracting keyword vectors to improve the scoring-based similarity calculation in the original nearest neighbor model based on semantic information. The idea of constructing the nearest neighbor model is simple and easy to understand, but the model has poor recommendation effect for sample data sparse or cold start scenarios and does not have good scalability.


### 2.2. Recommendation Method Based on the Hidden Semantic Model

Compared with the neighborhood-based collaborative recommendation model, the implicit semantic model based on matrix decomposition technique can better cope with the data sparsity problem. Moreover, it takes into account the influence of the implicit information in the scoring matrix on the recommendation effect. Literature [14] adds binarized user attributes to the implicit semantic model and uses the classification model to evaluate the importance of other user attributes and find out the similar users of the target user. Then, it combines the rating information of the target users to make predictions and recommendations. Based on the BERT model, deep nonlinear feature vectors of users and items can be extracted from the reviews, and the deep feature vectors of users and items are combined with potential hidden vectors to generate deep feature terms for predictive recommendations [15].


### 2.3. Collaborative Recommendation Method Based on Clustering Algorithm

The clustering algorithm belongs to an unsupervised learning method in machine learning, which can group sample data effectively. Therefore, clustering algorithms can be used in collaborative recommendation models to search for similar users of the target user. Literature [16] clusters label features to generate topic label clusters and constructs an item-topic association matrix combined with the original scoring matrix, to calculate the similarity between items. Finally, it uses a collaborative neighborhood-based recommendation model for predictive recommendation. Literature [17], on the other hand, improves the traditional recommendation model based on K-medoids clustering algorithm and probabilistic model to enhance the recommendation accuracy. By introducing a time decay function to preprocess the rating information, it proposed a collaborative recommendation model based on a clustering algorithm. Users and items are clustered based on user feature vectors and item attribute vectors, and then, an improved similarity calculation method is used to find similar users of the target user for predictive recommendation.


## 2.1. Collaborative Recommendation Method Based on the Neighborhood Model

The neighborhood model-based collaborative recommendation method is mainly based on the user’s historical behavior information to find the nearest neighbors with similar preferences for the user. It is based on the idea of “people are divided into groups” or “things are clustered together” to recommend items that may be of interest to users. At present, many scholars at home and abroad have improved the basic nearest neighbor model in different degrees to improve the model recommendation effect [11, 13]. Literature [11] proposes a QoS-aware personalized service recommendation method based on users’ rating of service quality attributes of services. It finds near-neighbor objects with similar QoS preferences for users by building a region model. Literature [13] constructs a user preference model by mining user text comment data and extracting keyword vectors to improve the scoring-based similarity calculation in the original nearest neighbor model based on semantic information. The idea of constructing the nearest neighbor model is simple and easy to understand, but the model has poor recommendation effect for sample data sparse or cold start scenarios and does not have good scalability.


## 2.2. Recommendation Method Based on the Hidden Semantic Model

Compared with the neighborhood-based collaborative recommendation model, the implicit semantic model based on matrix decomposition technique can better cope with the data sparsity problem. Moreover, it takes into account the influence of the implicit information in the scoring matrix on the recommendation effect. Literature [14] adds binarized user attributes to the implicit semantic model and uses the classification model to evaluate the importance of other user attributes and find out the similar users of the target user. Then, it combines the rating information of the target users to make predictions and recommendations. Based on the BERT model, deep nonlinear feature vectors of users and items can be extracted from the reviews, and the deep feature vectors of users and items are combined with potential hidden vectors to generate deep feature terms for predictive recommendations [15].


## 2.3. Collaborative Recommendation Method Based on Clustering Algorithm

The clustering algorithm belongs to an unsupervised learning method in machine learning, which can group sample data effectively. Therefore, clustering algorithms can be used in collaborative recommendation models to search for similar users of the target user. Literature [16] clusters label features to generate topic label clusters and constructs an item-topic association matrix combined with the original scoring matrix, to calculate the similarity between items. Finally, it uses a collaborative neighborhood-based recommendation model for predictive recommendation. Literature [17], on the other hand, improves the traditional recommendation model based on K-medoids clustering algorithm and probabilistic model to enhance the recommendation accuracy. By introducing a time decay function to preprocess the rating information, it proposed a collaborative recommendation model based on a clustering algorithm. Users and items are clustered based on user feature vectors and item attribute vectors, and then, an improved similarity calculation method is used to find similar users of the target user for predictive recommendation.


## 3. Methodology

### 3.1. Problem Description

Given a sample data set, each samplep,x,rpx represents a rpx grade for college English online course x given by student p. The sample data also contain the characteristics of student tags F1,F2,…,Fn. Each student p has a tag feature vector corresponding to it, and n represents the dimension of the tag feature vector of the student. The task of this paper is to mine the interactive information of student-student and student college English online courses from the information of student label characteristics and scoring and predict the score of target students on candidate college English online courses.As shown in Figure1, there are three modules. The first module uses spectral clustering algorithm to cluster students based on the characteristic vector of student tags obtained from sample data. In module 2, the score matrix is constructed in each subcluster and the cryptic meaning model based on matrix decomposition is used to locally predict missing score in each subcluster. Module 3 uses the improved collaborative recommendation model to make global prediction recommendation. This algorithm mines similar information among students, based on the characteristic information of students’ tags, and can find similar students without excessive comments, so it can solve the cold start. At the same time, the missing score is locally predicted in each submatrix in module 2, which solves the problem of data sparsity.Figure 1
The framework model of the proposed algorithm.


### 3.2. Spectral Clustering

In spectral clustering, all sample data are regarded as points in space and these points can be connected to form an undirected weighted graph. And, the weight of each edge is the similarity of the two vertices. The adjacency matrix can be obtained based on the similarity matrix. Then, the eigenvectors of the Laplacian matrix constructed by the sample data are clustered. In spectral clustering algorithm, there are three main methods to construct the adjacency matrix. They areε-neighborhood method, k nearest neighbor method, and full connection method. In this paper, we use the symmetric k nearest neighbor method.The KNN algorithm is used to traverse all sample points, and thek points closest to each sample point (the distance is measured by Gaussian kernel function) are taken as their nearest neighbors. It can be constructed as a symmetric adjacency matrix in the following two ways:(1)
As long as a point is in thek nearest neighbor of another point, mxy=exp−ix−iy22/2σ2; otherwise, mxy=0(2)
Only when two points are k-nearest neighbors to each other,mxy=exp−ix−iy22/2σ2; otherwise, mxy=0


### 3.3. Cryptic Meaning Model Based on Matrix Decomposition Technology

The implicit meaning model is derived from Simon Funk's improvement of singular value decomposition (SVD) algorithm by using gradient descent (GD). From the perspective of matrix decomposition, the cryptic meaning model decomposed the scoring matrixR into the product of two low-dimensional matrices related to student characteristics and college English online course characteristics, respectively.(1)R=UNV.U∈Rf×t, V∈Rf×w, and t and w are the number of students and the number of college English online courses, respectively. The student p’s score of college English online course x can be expressed as follows:(2)r^px=∑upf⋅vxf.Here, upf represents the f-th eigenvalue of student p. vxf represents the f-th eigenvalue of college English online course x. To obtain the parameters upf and vxf, we have the following formula:(3)Lu,v=∑p,x∈Trainrpx−r^px2.Train is the training set. Random gradient descent, least square method, coordinate descent, and other methods can be used to learn. In addition, in order to prevent overfitting, the overfitting term can be added to the loss functionλup2+vx2, λ is the regularization parameter.In addition, in practice, some attributes of students have nothing to do with college English online courses and some attributes of college English online courses have nothing to do with students. Therefore, bias items can be added to the prediction model, and SVD models with bias items added are called BiasSVD models.


### 3.4. Cluster Students Based on Student Characteristics and Spectral Clustering Algorithm

(1)
The sample pointI=i1,i2,…,it and then the student similarity matrix S=sxyt×n are calculated by using the K-nearest neighbor algorithm based on Gaussian kernel function and the student tag feature vector. Here, n is the label feature dimension.(4)sxy=exp−ix−iy222σ2.Then, the adjacency matrixM=mxyt×n is constructed. The similarity matrix constructed by the K-nearest neighbor method is not symmetric. Therefore, a symmetric K-nearest neighbor similarity matrix is constructed in the following way. As long as a point is in another point’s k-nearest neighbor, Sxy is retained.(5)mxy=0,ix∉ZTTiy&iy∉ZTTix,exp−ix−iy222σ2,ix∈ZTTiy|iy∈ZTTix.(2)
We construct degree matrixDwt according to the connection matrix; degree matrix D is a diagonal matrix.(3)
We calculate the Laplace matrix L:L = d−m.(4)
We use Ncut to findk minimum eigenvalues of Laplace matrix L to construct the characteristic matrix F.First, the normalized Laplace matrixLs is constructed, Ls=D−1/2LD−1/2=I−D−1/2WD−1/2, where x is the identity matrix.We calculate the eigenvalues of normalized Laplacian matrixLs, select the first k minimum eigenvalues, and calculate the corresponding eigenvectors f1,f2,…,fk.The matrix composed of the abovek feature vectors as column vectors is normalized according to rows, and finally, the feature matrix N=f1,f2,…,fk and N∈Rt×k with dimension t×k are formed.(5)
Letbx∈Rk be the i-th row vector of the characteristic matrix n as the new intermediate data sample point, where x = 1,2, …, t, and then, we use the k-means clustering to cluster the new sample points B=b1,b2,…,bt into clusters G1,G2,…,Gk.(6)
The cluster of the new sample points is transformed into the original student clusterC=C1,C2,…,Ck, where Cx=y|by∈Gx.


### 3.5. Missing Score of Local Prediction Based on the Cryptic Model

After grouping and clustering students based on the above steps, the original scoring matrix with a higher dimension can be divided intok smaller subscoring matrices. The cryptic meaning model based on matrix decomposition will be used to fill the missing score in the scoring matrix to solve data sparsity. The operations for each subscoring matrix are as follows.SupposeRa×w is a subscoring matrix, a is the number of students in the corresponding subcluster, and w is the number of college English online courses in the sample. In this paper, BiasSVD algorithm is used to decompose and predict the scoring matrix. The BiasSVD algorithm assumes that the scoring system includes two parts, bias term and interaction factor between students and college English online courses, as shown in(6)r^px=μ+hp+hx+∑fupf⋅vxf.Among them, the bias items include global meanμ, student bias item hp, and college English online course bias item hx.In the cryptic model, the parametershp, hx, upf, and vxf in Formula (6) are obtained by minimizing the loss function in(7)L=∑p,x∈trainrpx−μ−hp−hx−∑fupf⋅vxf2+λup2+vx2+hp2+hx2.Here, λup2+vx2+hp2+hx2 is a regular term added to prevent overfitting.Then, the stochastic gradient descent (SGD) method is used to solve the above loss function, and the partial derivative of each parameter can be obtained as follows:(8)∂L∂upf=−2ρpx⋅vxf+2λupf,∂L∂vxf=−2ρpx⋅upf+2λvxf,∂L∂hp=−2ρpx+2λhp,∂L∂hx=−2ρpx+2λhx,where ρpx=rpx−rpx=rpx−μ−hp−hx−∑fupf⋅vxf.Therefore, parameters hp, hx, upf, and vxf can be obtained iteratively by the following recursive formula:(9)hp←hp+γρpx−λhp,hx←hx+γρpx−λhx,upf←upf+γvxf⋅ρpx−λupf,vxf←vxf+γupf⋅ρpx−λvxf.Here,γ is the learning rate. Through the above implicit semantic model based on BiasSVD algorithm, the missing score can be locally predicted in each subscoring moment.


### 3.6. Score Prediction

After the local initial prediction of missing score in each subcluster, the subscore matrix was combined into the original score matrix and the improved neighborhood-based collaborative recommendation model was used to make the quadratic global prediction. The scoring matrix becomes very dense after missing scoring through local filling. If the traditional neighborhood-based collaborative recommendation model is used, the similarity value between all pairs of students needs to be calculated, which requires a large amount of calculation. Therefore, this paper usesk-means clustering algorithm again to cluster students based on student scoring vector and divides the student set into k classes again. Then, in the cluster where the target student is located, the similarity between the target student p and other students in the subcluster is calculated based on the Pearson Correlation Coefficient (PCC). The calculation equation is as follows:(10)sxwp,q=∑x∈XPQrpx−rp⋅rpx−rq∑x∈XPQrpx−rp2∑x∈XPQrpx−rq2,where rpx and rpx represent the scores of student p and student q for college English online course x, respectively. Xpq represents a collection of online college English courses that are all graded p and q by students. rp and rq represent the mean of student p and student q scores, respectively. Here, to set a threshold value of δ, Texp=q|sxwp,q≥δ,q∈P. P is the whole set of students, so the score of target student p on college English online course x can be predicted by(11)urpx=rl+∑q∈Texprqx−rl⋅sxwp,q∑q∈Texpsxwp,q.


## 3.1. Problem Description

Given a sample data set, each samplep,x,rpx represents a rpx grade for college English online course x given by student p. The sample data also contain the characteristics of student tags F1,F2,…,Fn. Each student p has a tag feature vector corresponding to it, and n represents the dimension of the tag feature vector of the student. The task of this paper is to mine the interactive information of student-student and student college English online courses from the information of student label characteristics and scoring and predict the score of target students on candidate college English online courses.As shown in Figure1, there are three modules. The first module uses spectral clustering algorithm to cluster students based on the characteristic vector of student tags obtained from sample data. In module 2, the score matrix is constructed in each subcluster and the cryptic meaning model based on matrix decomposition is used to locally predict missing score in each subcluster. Module 3 uses the improved collaborative recommendation model to make global prediction recommendation. This algorithm mines similar information among students, based on the characteristic information of students’ tags, and can find similar students without excessive comments, so it can solve the cold start. At the same time, the missing score is locally predicted in each submatrix in module 2, which solves the problem of data sparsity.Figure 1
The framework model of the proposed algorithm.


## 3.2. Spectral Clustering

In spectral clustering, all sample data are regarded as points in space and these points can be connected to form an undirected weighted graph. And, the weight of each edge is the similarity of the two vertices. The adjacency matrix can be obtained based on the similarity matrix. Then, the eigenvectors of the Laplacian matrix constructed by the sample data are clustered. In spectral clustering algorithm, there are three main methods to construct the adjacency matrix. They areε-neighborhood method, k nearest neighbor method, and full connection method. In this paper, we use the symmetric k nearest neighbor method.The KNN algorithm is used to traverse all sample points, and thek points closest to each sample point (the distance is measured by Gaussian kernel function) are taken as their nearest neighbors. It can be constructed as a symmetric adjacency matrix in the following two ways:(1)
As long as a point is in thek nearest neighbor of another point, mxy=exp−ix−iy22/2σ2; otherwise, mxy=0(2)
Only when two points are k-nearest neighbors to each other,mxy=exp−ix−iy22/2σ2; otherwise, mxy=0


## 3.3. Cryptic Meaning Model Based on Matrix Decomposition Technology

The implicit meaning model is derived from Simon Funk's improvement of singular value decomposition (SVD) algorithm by using gradient descent (GD). From the perspective of matrix decomposition, the cryptic meaning model decomposed the scoring matrixR into the product of two low-dimensional matrices related to student characteristics and college English online course characteristics, respectively.(1)R=UNV.U∈Rf×t, V∈Rf×w, and t and w are the number of students and the number of college English online courses, respectively. The student p’s score of college English online course x can be expressed as follows:(2)r^px=∑upf⋅vxf.Here, upf represents the f-th eigenvalue of student p. vxf represents the f-th eigenvalue of college English online course x. To obtain the parameters upf and vxf, we have the following formula:(3)Lu,v=∑p,x∈Trainrpx−r^px2.Train is the training set. Random gradient descent, least square method, coordinate descent, and other methods can be used to learn. In addition, in order to prevent overfitting, the overfitting term can be added to the loss functionλup2+vx2, λ is the regularization parameter.In addition, in practice, some attributes of students have nothing to do with college English online courses and some attributes of college English online courses have nothing to do with students. Therefore, bias items can be added to the prediction model, and SVD models with bias items added are called BiasSVD models.


## 3.4. Cluster Students Based on Student Characteristics and Spectral Clustering Algorithm

(1)
The sample pointI=i1,i2,…,it and then the student similarity matrix S=sxyt×n are calculated by using the K-nearest neighbor algorithm based on Gaussian kernel function and the student tag feature vector. Here, n is the label feature dimension.(4)sxy=exp−ix−iy222σ2.Then, the adjacency matrixM=mxyt×n is constructed. The similarity matrix constructed by the K-nearest neighbor method is not symmetric. Therefore, a symmetric K-nearest neighbor similarity matrix is constructed in the following way. As long as a point is in another point’s k-nearest neighbor, Sxy is retained.(5)mxy=0,ix∉ZTTiy&iy∉ZTTix,exp−ix−iy222σ2,ix∈ZTTiy|iy∈ZTTix.(2)
We construct degree matrixDwt according to the connection matrix; degree matrix D is a diagonal matrix.(3)
We calculate the Laplace matrix L:L = d−m.(4)
We use Ncut to findk minimum eigenvalues of Laplace matrix L to construct the characteristic matrix F.First, the normalized Laplace matrixLs is constructed, Ls=D−1/2LD−1/2=I−D−1/2WD−1/2, where x is the identity matrix.We calculate the eigenvalues of normalized Laplacian matrixLs, select the first k minimum eigenvalues, and calculate the corresponding eigenvectors f1,f2,…,fk.The matrix composed of the abovek feature vectors as column vectors is normalized according to rows, and finally, the feature matrix N=f1,f2,…,fk and N∈Rt×k with dimension t×k are formed.(5)
Letbx∈Rk be the i-th row vector of the characteristic matrix n as the new intermediate data sample point, where x = 1,2, …, t, and then, we use the k-means clustering to cluster the new sample points B=b1,b2,…,bt into clusters G1,G2,…,Gk.(6)
The cluster of the new sample points is transformed into the original student clusterC=C1,C2,…,Ck, where Cx=y|by∈Gx.


## 3.5. Missing Score of Local Prediction Based on the Cryptic Model

After grouping and clustering students based on the above steps, the original scoring matrix with a higher dimension can be divided intok smaller subscoring matrices. The cryptic meaning model based on matrix decomposition will be used to fill the missing score in the scoring matrix to solve data sparsity. The operations for each subscoring matrix are as follows.SupposeRa×w is a subscoring matrix, a is the number of students in the corresponding subcluster, and w is the number of college English online courses in the sample. In this paper, BiasSVD algorithm is used to decompose and predict the scoring matrix. The BiasSVD algorithm assumes that the scoring system includes two parts, bias term and interaction factor between students and college English online courses, as shown in(6)r^px=μ+hp+hx+∑fupf⋅vxf.Among them, the bias items include global meanμ, student bias item hp, and college English online course bias item hx.In the cryptic model, the parametershp, hx, upf, and vxf in Formula (6) are obtained by minimizing the loss function in(7)L=∑p,x∈trainrpx−μ−hp−hx−∑fupf⋅vxf2+λup2+vx2+hp2+hx2.Here, λup2+vx2+hp2+hx2 is a regular term added to prevent overfitting.Then, the stochastic gradient descent (SGD) method is used to solve the above loss function, and the partial derivative of each parameter can be obtained as follows:(8)∂L∂upf=−2ρpx⋅vxf+2λupf,∂L∂vxf=−2ρpx⋅upf+2λvxf,∂L∂hp=−2ρpx+2λhp,∂L∂hx=−2ρpx+2λhx,where ρpx=rpx−rpx=rpx−μ−hp−hx−∑fupf⋅vxf.Therefore, parameters hp, hx, upf, and vxf can be obtained iteratively by the following recursive formula:(9)hp←hp+γρpx−λhp,hx←hx+γρpx−λhx,upf←upf+γvxf⋅ρpx−λupf,vxf←vxf+γupf⋅ρpx−λvxf.Here,γ is the learning rate. Through the above implicit semantic model based on BiasSVD algorithm, the missing score can be locally predicted in each subscoring moment.


## 3.6. Score Prediction

After the local initial prediction of missing score in each subcluster, the subscore matrix was combined into the original score matrix and the improved neighborhood-based collaborative recommendation model was used to make the quadratic global prediction. The scoring matrix becomes very dense after missing scoring through local filling. If the traditional neighborhood-based collaborative recommendation model is used, the similarity value between all pairs of students needs to be calculated, which requires a large amount of calculation. Therefore, this paper usesk-means clustering algorithm again to cluster students based on student scoring vector and divides the student set into k classes again. Then, in the cluster where the target student is located, the similarity between the target student p and other students in the subcluster is calculated based on the Pearson Correlation Coefficient (PCC). The calculation equation is as follows:(10)sxwp,q=∑x∈XPQrpx−rp⋅rpx−rq∑x∈XPQrpx−rp2∑x∈XPQrpx−rq2,where rpx and rpx represent the scores of student p and student q for college English online course x, respectively. Xpq represents a collection of online college English courses that are all graded p and q by students. rp and rq represent the mean of student p and student q scores, respectively. Here, to set a threshold value of δ, Texp=q|sxwp,q≥δ,q∈P. P is the whole set of students, so the score of target student p on college English online course x can be predicted by(11)urpx=rl+∑q∈Texprqx−rl⋅sxwp,q∑q∈Texpsxwp,q.


## 4. Result Analysis and Discussion

The experimental data set is from the actual operation data of an online teaching website, with 13,680 students and a total of 737 courses, mainly college English-related courses. The data included students’ learning records and scoring records from May 2014 to July 2017, with a total of 148,170 records. The training set accounted for 80%, about 118,000 records, and the test set accounted for 20%, about 30,000 records. First, the data are simplified into triples (student id, study time, and course id).The evaluation index of the algorithm is precision, which refers to the proportion of the courses actually learned by students among all the courses recommended for display, as shown in(12)precision=∑p⊆PRp∩Np∑p⊆PRp,where Np represents all courses actually learned by student p and Rp represents all courses recommended to student p. The higher the accuracy rate is, the better the recommended courses meet students’ expectations.We input the course sequence that students have learned in the test set, output a course sequence after model processing, take the last course as the recommended course of students, and judge whether the recommended result is accurate compared with the courses that students actually learn.All courses are divided into three categories: English reading, English listening and speaking, and English writing. The data set is divided into three subsets accordingly. Table1 records the recommendation results based on the traditional collaborative algorithm under the manual classification of websites.Table 1
Recommended results based on artificial classification of websites.
CategoryNumber of coursesAccuracyAll courses1370.126English reading380.298English listening and speaking470.373English writing520.387Weighted accuracy—0.206The recommendation results of all categories are generally better than those of all courses after classification.The algorithm in this paper is used for automatic classification of courses, and three course categories are obtained. Table2 shows the corresponding recommendations.Table 2
Recommended results based on the proposed algorithm.
CategoryNumber of coursesAccuracyAll courses1370.126Course 1290.211Course 2450.369Course 3630.406Weighted accuracy—0.288Compared with the results of manual classification in Table1, the recommendation algorithm performs better than manual classification in most categories divided and the accuracy of weighting is increased by 8.2%.The comparison of the accuracy of the proposed algorithm with those in literature [11, 18–20] and literature [21] in the same data set is shown in Table 3 and Figure 2.Table 3
Accuracy comparison of six algorithms.
CategoryLiterature [18]Literature [19]Literature [20]Literature [11]Literature [21]ProposedAll courses0.0310.0160.0450.0220.0770.126Course 10.0160.0210.0150.0120.0190.038Course 20.0550.0280.0620.0690.0790.098Course 30.1120.1410.1220.1370.1550.186Figure 2
Accuracy comparison of six algorithms.Except for all course categories, the accuracy index of the proposed algorithm is much higher than of the other five algorithms. Compared with the other five algorithms, the proposed algorithm is more suitable for the recommendation of courses with strong temporal dependence.The performance of the intelligent collaborative recommendation method based on the spectral clustering and cryptic model is not only related to the structure size of the collaborative recommendation algorithm but also highly dependent on the training sample size. Therefore, the sample size of training participants was set differently to verify its recommended performance, and the results are shown in Table4 and Figure 3. The initial training and testing sample ratio is 8 : 2.Table 4
RMSE of different training sample sizes.
⟶Data setTraining set ratio/%RMSEEnglish reading800.8248600.8969400.9255201.1659English listening and speaking800.839600.9194400.9391201.2067English writing800.9685601.0011401.1506201.3978Figure 3
RMSE with different training sample sizes.When the number of training samples decreases, the recommended RMSE values of the three data sets all rise. When the proportion of the training set decreased from 80% to 20%, the RMSE performance of English reading, English listening and speaking, and English writing decreased by 34.11%, 36.77%, and 42.93%, respectively. By comparison, the personalized recommendation of English writing is most sensitive to the sparsity of the training sample set, followed by the sparsity of English listening and speaking, and the sparsity of the sample set has the least influence on the sparsity of English reading. In conclusion, when the proportion of the training set is 80%, the optimal personalized recommendation performance can be obtained.To verify the recommended performance of different algorithms for three kinds of data sets, six algorithms were used to train the three kinds of data sets, respectively. Figures4–6 show the results. According to the results in Table 4, the number of nodes involved in training for the six algorithms is 80% of the total sample number.Figure 4
RMSE of six algorithms (English reading).Figure 5
RMSE of six algorithms (English listening and speaking).Figure 6
RMSE of six algorithms (English writing).RMSE in this paper includes all the lowest values, which indicates that the proposed algorithm has the highest recommendation accuracy for these three data sets. In terms of order of accuracy of personalized recommendation, the algorithm in this paper has the best performance, followed by literature [20], and those in literature [18] and literature [21] have the worst RMSE performance. In terms of running time, algorithms in literature [18] and literature [21] are the best, while the algorithm in this paper and literature [20] perform poorly. The main reason is that the operation of the deep learning framework requires multiple positive and negative updates, resulting in high operation time consuming steps.


## 5. Conclusion

No recommendation algorithm is absolutely superior to another recommendation algorithm. Therefore, multiple recommendation models can be effectively integrated to build a hybrid recommendation model with higher performance. Based on this, an intelligent collaborative recommendation method based on spectral clustering and cryptic model is proposed. The method uses the KNN model-based spectral clustering algorithm to mine similar information among students and then groups the students into clusters. Then, the original scoring matrix is divided into several subscoring matrices with lower dimensions based on clustering. Then, a matrix decomposition model based on the cryptic meaning model is used to locally predict the missing score in each subscore matrix. Finally, the improved neighborhood-based collaborative recommendation algorithm is used to predict the global score of the target students. Experimental results show that the proposed algorithm effectively solves the problem of data sparsity and cold start and accelerates the efficiency of the recommendation algorithm while improving the accuracy of prediction. The next step mainly includes constructing the relationship diagram between students and English online courses by using a knowledge graph to obtain more specific characteristics of students and English online courses and constructing a prediction model by using the deep learning method to further improve recommendation accuracy.



---

*Source: 7133654-2022-07-12.xml*