# Evaluation Method of IT English Blended Teaching Quality Based on the Data Mining Algorithm

Authors: Lin Shao
Journal: Journal of Mathematics
 (2021)

---

## Abstract

As the mixed education model gradually becomes widespread in various universities in Japan, the evaluation of the quality of IT English mixed education has become a very important issue, and it is worth considering the corresponding evaluation method. In this paper, we use a data mining algorithm to implement an evaluation method for the interconversion of quantitative data and qualitative concepts and use the IT English mixed teaching model to evaluate and analyze the teaching quality of the course. The evaluation method is feasible and provides a mixing method. Evaluation of the quality of education. Reference method.


---

## Body

## 1. Introduction

With the progress of educational reform in universities, the IT English mixed education model is attracting more and more attention from various universities, and many university teachers conduct practical education and topic research aimed at reforming mixed curriculum education [1, 2]. Blended teaching is becoming more and more important, which is welcomed by the majority of teachers and students. Therefore, what is the quality of education in the IT English mixed education model and how to evaluate the quality of education in this education model are the important issues faced by domestic universities in monitoring the quality of education [3–5]. This requires the establishment of an effective and comprehensive evaluation system for the IT English mixed education model, and we are actively considering various educational quality evaluation methods under the mixed education model. At universities, there are many reference methods for daily class quality evaluation, and from the perspective of fuzzy data processing, there are rough set theory and fuzzy evaluation methods, but they have drawbacks. For example, the rough set theory adopts the idea of removing redundant data, so the reduced information is relatively incomplete. The fuzzy evaluation method has a strong subjectivity in acquiring the fuzzy evaluation matrix, so the rigor of the evaluation result is low. Due to the randomness and ambiguity of the educational evaluation itself, it is necessary for our evaluation method to be able to reflect the randomness and ambiguity of this evaluation so that the evaluation results are more consistent with the actual situation. In addressing these issues, Thoma et al. used a reverse cloud generator to achieve qualitative and quantitative transformation of evaluation reviews and a virtual cloud algorithm to obtain a comprehensive evaluation cloud model [6–10]. Ye Yong proposed a cloud model-based classroom quality data mining method to estimate the nonlinear relationship between classroom quality and metrics. With the advent of data mining algorithms, data mining algorithms have been applied to various qualitative evaluations of the system and achieved specific results. The application of data mining algorithms in qualitative evaluations can accurately reflect the actual situation of the evaluated object and reflect the randomness and ambiguity of the evaluation itself. This article explores its application in the quality assessment of mixed education using the relevant theory of data mining algorithms. Section 2 of this paper describes data mining. On the basis of this data mining, Section 3 proposes a model evaluation method. Section 4 presents the design of the proposed model. In Section 5, the experimental design and experimental analysis are carried out. In Section 6, the conclusion is given.


## 2. Description of Data Mining

Data mining generally refers to the process of finding hidden information in large amounts of data using a variety of methods such as statistics, online analytics, and intelligence searches. Education data mining refers to the application of multiple disciplines of theory and methods for describing data so that people can quickly distinguish data. Through data mining processes such as clustering and associations, we provide students with video viewing tools for education, research, and solving time problems. For example, teachers can find student learning rules based on student learning data and teach them to effectively improve their teaching methods. This improves educational efficiency and builds effective explanatory models to predict and analyze future education, as shown in Figure1.Figure 1
Modeling estimation driven by data.Theoretical methods of data mining models are used to teach evaluation. It mainly uses the three digital feature values of the data mining model (expectationsEx, entropy En, and superentropy He) to characterize the results of the evaluation and analyze more detailed information to teach the evaluation. In expectations, Ex represents the center point of the evaluation value which indicates the definite value of the comment, where expectations Ex value falls within which comment value range of the evaluation result belongs to the comment level. Entropy En reflects the ambiguity of the comment result, En bigger explains that the comment level is more blurred, superentropy He reflects the degree of dispersion of the evaluation result from the evaluation curve, En explains that the uncertainty of the evaluation result is higher. The three digital feature values of the data mining model can be calculated using the data mining model reverse cloud generator method; that is, the digital feature values of the data mining model for each rating index are obtained from a large number of quantitative ratings. The specific calculation process is as follows: you can get the calculation steps of the reference.


## 3. Model Evaluation Method Based on Data Mining

Data mining models can achieve effective transformations between quantitative and qualitative concepts, thus transforming large amounts of specific evaluation data into corresponding natural comments. According to the evaluated index data, the inverse cloud generator of the data mining model is used to calculate the digital feature values of the data mining model of each index and analyze the meaning of the digital feature values [11, 12]. Because IT English mixed education involves independent learning of online courses and classroom education, the entire teaching process includes many online and offline links. Therefore, in addition to assessing the quality of teachers’ traditional classroom education, students should be assessed online. The status of self-learning and the quality of online learning resources are assessed. Due to limited space, this article evaluates and analyzes the learning situation of the school’s open course “College English” from the student’s perspective and describes the process of applying a data mining model in educational evaluation. The specific process for applying for an educational evaluation is as follows [13, 14].


### 3.1. Specific Evaluation Indicators for Curriculum Design

In order to better reflect the actual situation of the course education and improve the quality of the course education evaluation, it is necessary to combine the educational practices of specific courses to develop the evaluation index corresponding to the course. If the course is a theoretical course or a hands-on course with a high percentage of hands-on operation, the corresponding metrics should be different to emphasize the characteristics of the course [15]. For example, the training direction of a university’s open English course is to pay more attention to the student’s language proficiency, and the corresponding content should be reflected in the designed metrics. In addition, the design of the metric system not only considers the comprehensiveness of the metric but also analyzes the importance of each metric in the overall metrics and reasonable weights each metric [16]. Two grades of metrics are set according to the teaching method of the “College English” course. One-step indicators are set up for online learning, learning resources, and classroom learning. Second-level indicators of “online learning” can be set as a result of self-learning attitudes, video viewing progress, and online testing. Second-level indicators under “learning resources” can be set as course video resources, course exercise resources, and course experiment resources. Second-level indicators under “learning in the classroom” can be set as teacher teaching attitudes, teacher teaching abilities, and module test scores [17, 18].


### 3.2. Scoring Various Indicators

Surveys are designed and published, students and related personnel are organized to score various metrics, these scoring data are collected, and some invalid data are processed according to the metrics set summarizing valid data.


### 3.3. Calculating the Digital Feature Value of the Data Mining Model of Various Indicators

Based on the scoring data for each metric, the data mining model reverse cloud generator is used to calculate the data for each metric to get the low-level digital feature values for the data mining model for each metric. These numerical characteristic values reflect the score distribution of each particular indicator.


### 3.4. Calculating the Comprehensive Evaluation

According to the digital function values of the cloud model of the low-level indicator, the data mining calculation method can be used to calculate the data mining model parameters of the high-level indicator layer by layer, and finally, the comprehensive evaluation parameters can be calculated and obtained. The overall assessment is used as the final outcome of this assessment and as a reference for measuring the comment level of the quality of education assessment [19].


### 3.5. Set Comment Collection

According to the practice of daily education evaluation of the school, the final comment set of the evaluation of the quality of education is set to four levels of “excellent, good, medium, and bad,” and the division interval corresponding to each evaluation level is set and increased. The corresponding “excellent” level score is 9–10 points, the “good” level is 8–9 points, the “medium” level is 6–8 points, and the corresponding score is “bad.” The level is 6–8 points. Values are 0–6 minutes. If the expected value of the overall rating is within the score range corresponding to the “excellent” level, the result of this rating is “excellent.”


### 3.6. Drawing a Cloud Map

Rooting and rendering are simulated and analyzed by MATLAB, etc. The method is similar to the observation point and distribution shape, intuitive judgment, combined conclusion result, etc.


### 3.7. Analysis and Evaluation Results

As comprehensive evaluation combines the cloud digital feature values and the cloud drop distribution state of the cloud map, the evaluation results are analyzed, and more detailed information on educational evaluation is unearthed. Using the cloud model evaluation method, the digital characteristic of each index in each layer of the index can be analyzed concretely, and the evaluation result of each index in the evaluation can be obtained. If the expected value of a certain magical index is low, further improvement is needed in the future, and educational reform can be carried out appropriately. A low module test score in the classroom indicates that the ability to apply knowledge comprehensively is inadequate and that comprehensive content training can be conducted during normal hours. If the expected value of a certain magical index is too high, it means that the magical index is highly recognized. For example, the test shows that the expected value of the teacher’s teaching attitude score is the highest of all indicators, indicating that the student is aware of the teacher’s teaching attitude. If the superentropy value of the indicator is too large, it means that the metric’s score has high volatility, which means that the gap between most scores is large.


## 3.1. Specific Evaluation Indicators for Curriculum Design

In order to better reflect the actual situation of the course education and improve the quality of the course education evaluation, it is necessary to combine the educational practices of specific courses to develop the evaluation index corresponding to the course. If the course is a theoretical course or a hands-on course with a high percentage of hands-on operation, the corresponding metrics should be different to emphasize the characteristics of the course [15]. For example, the training direction of a university’s open English course is to pay more attention to the student’s language proficiency, and the corresponding content should be reflected in the designed metrics. In addition, the design of the metric system not only considers the comprehensiveness of the metric but also analyzes the importance of each metric in the overall metrics and reasonable weights each metric [16]. Two grades of metrics are set according to the teaching method of the “College English” course. One-step indicators are set up for online learning, learning resources, and classroom learning. Second-level indicators of “online learning” can be set as a result of self-learning attitudes, video viewing progress, and online testing. Second-level indicators under “learning resources” can be set as course video resources, course exercise resources, and course experiment resources. Second-level indicators under “learning in the classroom” can be set as teacher teaching attitudes, teacher teaching abilities, and module test scores [17, 18].


## 3.2. Scoring Various Indicators

Surveys are designed and published, students and related personnel are organized to score various metrics, these scoring data are collected, and some invalid data are processed according to the metrics set summarizing valid data.


## 3.3. Calculating the Digital Feature Value of the Data Mining Model of Various Indicators

Based on the scoring data for each metric, the data mining model reverse cloud generator is used to calculate the data for each metric to get the low-level digital feature values for the data mining model for each metric. These numerical characteristic values reflect the score distribution of each particular indicator.


## 3.4. Calculating the Comprehensive Evaluation

According to the digital function values of the cloud model of the low-level indicator, the data mining calculation method can be used to calculate the data mining model parameters of the high-level indicator layer by layer, and finally, the comprehensive evaluation parameters can be calculated and obtained. The overall assessment is used as the final outcome of this assessment and as a reference for measuring the comment level of the quality of education assessment [19].


## 3.5. Set Comment Collection

According to the practice of daily education evaluation of the school, the final comment set of the evaluation of the quality of education is set to four levels of “excellent, good, medium, and bad,” and the division interval corresponding to each evaluation level is set and increased. The corresponding “excellent” level score is 9–10 points, the “good” level is 8–9 points, the “medium” level is 6–8 points, and the corresponding score is “bad.” The level is 6–8 points. Values are 0–6 minutes. If the expected value of the overall rating is within the score range corresponding to the “excellent” level, the result of this rating is “excellent.”


## 3.6. Drawing a Cloud Map

Rooting and rendering are simulated and analyzed by MATLAB, etc. The method is similar to the observation point and distribution shape, intuitive judgment, combined conclusion result, etc.


## 3.7. Analysis and Evaluation Results

As comprehensive evaluation combines the cloud digital feature values and the cloud drop distribution state of the cloud map, the evaluation results are analyzed, and more detailed information on educational evaluation is unearthed. Using the cloud model evaluation method, the digital characteristic of each index in each layer of the index can be analyzed concretely, and the evaluation result of each index in the evaluation can be obtained. If the expected value of a certain magical index is low, further improvement is needed in the future, and educational reform can be carried out appropriately. A low module test score in the classroom indicates that the ability to apply knowledge comprehensively is inadequate and that comprehensive content training can be conducted during normal hours. If the expected value of a certain magical index is too high, it means that the magical index is highly recognized. For example, the test shows that the expected value of the teacher’s teaching attitude score is the highest of all indicators, indicating that the student is aware of the teacher’s teaching attitude. If the superentropy value of the indicator is too large, it means that the metric’s score has high volatility, which means that the gap between most scores is large.


## 4. Model Design

### 4.1. Dynamic Time Warping Algorithm

Data processing and analysis must rely on education. Due to different educational situations, the particle size of the collection time for different mixed education data is different. This causes the time dimension to accumulate different data formats, making it impossible to unify the time period. In this scenario, it is difficult for a typical data mining model to deliver its own performance, so this white paper presents a dynamic time warping (DTW) algorithm for data processing and analysis. The basic principles are as follows:Suppose the test dataset isR, the training dataset is T, and the dimensions of each dataset sample are m and n. For supervised learning algorithms, we need to compare the similarities between the test and training datasets. At this time, the similarity of the samples can be measured by calculating the Euclidean distance D between the samples. If n=m,(1)DT,R=∑i=1MDTi,Ri2,when n≠m needs to introduce the idea of dynamic programming to calculate D.As shown in Figure2, the test sample serial numbers are marked on the x-axis of the Cartesian coordinate system, and the training samples are marked on the y-axis. At this time, a cross grid can be formed on the coordinate axes, and the intersection of the grid becomes the intersection of the test sample and the training sample. At the same time, you need to find a path from the lower-left corner to the upper right corner of the axes. The i-th point that passes through this path is written as ni,mi, and the path function is written. Thatis why(2)mi=φni,n=i,φ1=1,φN=M.Figure 2
DTW algorithm path search principle.When searching for a path, you need to limit the gradient to ensure the direction of the path. The slope usually varies from 0.5 to 2. If the point of the path that passes through at this time isni−1,mi−1, then all possible situations at the next point are(3)ni,mi=ni−1+1,mi−1+2,ni,mi=ni−1+1,mi−1+1,ni,mi=ni−1+1,mi−1.At this time, the above equation is used as the constraint condition, the best path in equation (1) is solved, the shortest path is taken as the optimization objective, and the objective function is obtained as follows:(4)∑ni=1mi=FnihNDni,mi=minFni∑ni=1mi=FniNDni,mi.At any point on the axes, only one path can eventually be passed during the path search process. So, forni,mi, there are only three cases ni−1,mi, ni−1,mi−1−1, or ni−1,mi−2 at the previous point on the path. At this time, you need to select the point with the shortest distance from point ni,mi to the two points in these three cases as the previous node on the path. At this point, the total distance of the path can be obtained as follows:(5)Dni−1,mi−1=minDni−1,miDni−1,mi−1−1Dni−1,mi−2.


### 4.2. Improved DTW Algorithm Based on Dynamic Bending

In the above equation, the DTW algorithm limits the slope of the path bend during the path search process. However, there are some points where this limitation cannot be met in the actual iterative process. Taking Figure3 as an example, if the diamonds in Figure 3 perform distance matching, it is not necessary to calculate the distance outside the grid points. Due to the geometric properties of the diamond, it is not necessary to store the cumulative distance of every step in the calculation.Figure 3
Schematic diagram of algorithm path constraint.In Figure3, the actual bend is divided into three path segments: 1,Xa, Xa+1,Xb, and Xb+1,N, and the coordinates have the following relationship:(6)Xa=132M−N,Xb=232N−M.TakingXa and Xb as close integers, the constraint conditions for dynamic bending matching can be obtained at this time:(7)2M−N≥3,2N−M≥2.After introducing dynamic bending, there is no need to compare theX-axis feature vector with the feature vector corresponding to the Y-axis point. All you have to do is to compare it to the eigenvectors of ymin,ymax. The calculation method of the endpoints of this section is as follows:(8)ymin=12x,0≤x≤Xb,2x+M−2N,Xb≤x≤N,ymax=2x,0≤x≤Xa,12x+M−12N,Xa≤x≤N.At this time, the update method of distance accumulation is as follows:(9)Dx,y=dx,y+minDx−1,yDx−1,y−1Dx−1,y−2.According to the above equation, if theX-axis time label advances gradually, you only need to pay attention to the cumulative distance in the previous column. Therefore, the algorithm does not have to store all the distance matrices, thereby achieving the goal of saving the memory required for the operation. Figure 4 shows the specific update method.Figure 4
Cumulative distance update method.


## 4.1. Dynamic Time Warping Algorithm

Data processing and analysis must rely on education. Due to different educational situations, the particle size of the collection time for different mixed education data is different. This causes the time dimension to accumulate different data formats, making it impossible to unify the time period. In this scenario, it is difficult for a typical data mining model to deliver its own performance, so this white paper presents a dynamic time warping (DTW) algorithm for data processing and analysis. The basic principles are as follows:Suppose the test dataset isR, the training dataset is T, and the dimensions of each dataset sample are m and n. For supervised learning algorithms, we need to compare the similarities between the test and training datasets. At this time, the similarity of the samples can be measured by calculating the Euclidean distance D between the samples. If n=m,(1)DT,R=∑i=1MDTi,Ri2,when n≠m needs to introduce the idea of dynamic programming to calculate D.As shown in Figure2, the test sample serial numbers are marked on the x-axis of the Cartesian coordinate system, and the training samples are marked on the y-axis. At this time, a cross grid can be formed on the coordinate axes, and the intersection of the grid becomes the intersection of the test sample and the training sample. At the same time, you need to find a path from the lower-left corner to the upper right corner of the axes. The i-th point that passes through this path is written as ni,mi, and the path function is written. Thatis why(2)mi=φni,n=i,φ1=1,φN=M.Figure 2
DTW algorithm path search principle.When searching for a path, you need to limit the gradient to ensure the direction of the path. The slope usually varies from 0.5 to 2. If the point of the path that passes through at this time isni−1,mi−1, then all possible situations at the next point are(3)ni,mi=ni−1+1,mi−1+2,ni,mi=ni−1+1,mi−1+1,ni,mi=ni−1+1,mi−1.At this time, the above equation is used as the constraint condition, the best path in equation (1) is solved, the shortest path is taken as the optimization objective, and the objective function is obtained as follows:(4)∑ni=1mi=FnihNDni,mi=minFni∑ni=1mi=FniNDni,mi.At any point on the axes, only one path can eventually be passed during the path search process. So, forni,mi, there are only three cases ni−1,mi, ni−1,mi−1−1, or ni−1,mi−2 at the previous point on the path. At this time, you need to select the point with the shortest distance from point ni,mi to the two points in these three cases as the previous node on the path. At this point, the total distance of the path can be obtained as follows:(5)Dni−1,mi−1=minDni−1,miDni−1,mi−1−1Dni−1,mi−2.


## 4.2. Improved DTW Algorithm Based on Dynamic Bending

In the above equation, the DTW algorithm limits the slope of the path bend during the path search process. However, there are some points where this limitation cannot be met in the actual iterative process. Taking Figure3 as an example, if the diamonds in Figure 3 perform distance matching, it is not necessary to calculate the distance outside the grid points. Due to the geometric properties of the diamond, it is not necessary to store the cumulative distance of every step in the calculation.Figure 3
Schematic diagram of algorithm path constraint.In Figure3, the actual bend is divided into three path segments: 1,Xa, Xa+1,Xb, and Xb+1,N, and the coordinates have the following relationship:(6)Xa=132M−N,Xb=232N−M.TakingXa and Xb as close integers, the constraint conditions for dynamic bending matching can be obtained at this time:(7)2M−N≥3,2N−M≥2.After introducing dynamic bending, there is no need to compare theX-axis feature vector with the feature vector corresponding to the Y-axis point. All you have to do is to compare it to the eigenvectors of ymin,ymax. The calculation method of the endpoints of this section is as follows:(8)ymin=12x,0≤x≤Xb,2x+M−2N,Xb≤x≤N,ymax=2x,0≤x≤Xa,12x+M−12N,Xa≤x≤N.At this time, the update method of distance accumulation is as follows:(9)Dx,y=dx,y+minDx−1,yDx−1,y−1Dx−1,y−2.According to the above equation, if theX-axis time label advances gradually, you only need to pay attention to the cumulative distance in the previous column. Therefore, the algorithm does not have to store all the distance matrices, thereby achieving the goal of saving the memory required for the operation. Figure 4 shows the specific update method.Figure 4
Cumulative distance update method.


## 5. Experimental Design and Analysis

### 5.1. Experimental Design

To evaluate the performance of the algorithm, you need to collect and analyze the data. In this article, we will select relevant data for mixed education at the university. The bibliography [4] method (method 1), bibliography [5] method (method 2), and bibliography [6] method (method 3) are used to test and compare the detection rates of the various methods. The description of the recall rate is as follows: the percentage of anomalous data detected in the overall anomaly of the correct information sample is calculated as follows:(10)detectionrate=truepositivetruepositive+falsenegative.In the above formula, true positive represents the true positive rate and true negative represents the true negative class. Recall rate of an abnormal dataset is shown in Figure5.Figure 5
Recall rate of abnormal dataset.From the data in Figure5, it can be seen that the recall rate of the abnormal points in Method 1 is higher than that in Methods 2 and 3, and the recall rate in Method 1 is as high as 98% or more. 1 is in the diagnostic information for COPD. Prior to the automatic mining of sensitive data, we used an unsupervised step-by-step learning method to clean up sensitive data in COPD diagnostic information. This has reduced a large amount of duplicate data in the database and improved the recall rate. To further verify the overall effectiveness of this method, the method above is used to test the automatic mining of sensitive data for COPD diagnostic information and compare the time spent of the three methods with the same amount of data, Figure 6.Figure 6
Time consumption.Analyzing Figure6 shows that with the same amount of data, Method 1 consumes less time than Methods 2 and 3. This is because Method 1 is based on the data cleaning framework for sensitive data in COPD diagnostic information. The cleaning process eliminated erroneous data in COPD diagnostic data, reduced the time required for automatic mining of sensitive data in COPD diagnostic information, and verified the efficiency of Method 1. The error data detection rates of the above three methods are compared. The detection rate of incorrect data can be calculated by the following formula:(11)detectionaccuracy=TN+TPFN+TN+FP+TP.In the above formula,TP represents that the wrong data is judged wrong data, TN represents that the correct data is judged correct data, FP represents that the correct data is judged wrong, and FN represents that the wrong data is judged correct data.The detection capabilities of the three methods for erroneous data are shown in Figure7.Figure 7
Detection rate of wrong data.As the amount of data increases, the ability to detect incorrect data decreases. Analyzing Figure7 shows that the error detection rate for Method 1 decreases with increasing data volume, but all exceeds 80%. It automatically resolves and records the optimal boundary function for sensitive data in mined COPD diagnostic information, processes large numbers of unlabeled data records, and detects all incorrect data in the database to avoid data nonuniformity. Other useless data improves your ability to detect false data.


## 5.1. Experimental Design

To evaluate the performance of the algorithm, you need to collect and analyze the data. In this article, we will select relevant data for mixed education at the university. The bibliography [4] method (method 1), bibliography [5] method (method 2), and bibliography [6] method (method 3) are used to test and compare the detection rates of the various methods. The description of the recall rate is as follows: the percentage of anomalous data detected in the overall anomaly of the correct information sample is calculated as follows:(10)detectionrate=truepositivetruepositive+falsenegative.In the above formula, true positive represents the true positive rate and true negative represents the true negative class. Recall rate of an abnormal dataset is shown in Figure5.Figure 5
Recall rate of abnormal dataset.From the data in Figure5, it can be seen that the recall rate of the abnormal points in Method 1 is higher than that in Methods 2 and 3, and the recall rate in Method 1 is as high as 98% or more. 1 is in the diagnostic information for COPD. Prior to the automatic mining of sensitive data, we used an unsupervised step-by-step learning method to clean up sensitive data in COPD diagnostic information. This has reduced a large amount of duplicate data in the database and improved the recall rate. To further verify the overall effectiveness of this method, the method above is used to test the automatic mining of sensitive data for COPD diagnostic information and compare the time spent of the three methods with the same amount of data, Figure 6.Figure 6
Time consumption.Analyzing Figure6 shows that with the same amount of data, Method 1 consumes less time than Methods 2 and 3. This is because Method 1 is based on the data cleaning framework for sensitive data in COPD diagnostic information. The cleaning process eliminated erroneous data in COPD diagnostic data, reduced the time required for automatic mining of sensitive data in COPD diagnostic information, and verified the efficiency of Method 1. The error data detection rates of the above three methods are compared. The detection rate of incorrect data can be calculated by the following formula:(11)detectionaccuracy=TN+TPFN+TN+FP+TP.In the above formula,TP represents that the wrong data is judged wrong data, TN represents that the correct data is judged correct data, FP represents that the correct data is judged wrong, and FN represents that the wrong data is judged correct data.The detection capabilities of the three methods for erroneous data are shown in Figure7.Figure 7
Detection rate of wrong data.As the amount of data increases, the ability to detect incorrect data decreases. Analyzing Figure7 shows that the error detection rate for Method 1 decreases with increasing data volume, but all exceeds 80%. It automatically resolves and records the optimal boundary function for sensitive data in mined COPD diagnostic information, processes large numbers of unlabeled data records, and detects all incorrect data in the database to avoid data nonuniformity. Other useless data improves your ability to detect false data.


## 6. Conclusion

Data mining models can enable the conversion of quantitative data to qualitative assessments and are an effective tool for teaching quality assessments. The data mining model has certain advantages in dealing with mixed educational quality assessments. It can not only get the results of a comprehensive assessment but also reflects the ambiguity and randomness of the assessment data, reflecting the reliability and rationality of the assessment process. In addition, the data mining model method can be used to mine the meaning contained in the evaluation data and obtain more detailed evaluation information so that it is possible to find specific problems in education that are convenient for teachers and improve education in a targeted way, thereby improving educational effectiveness. Of course, when assessing education using a data mining model, there are some issues that make the computational process more complex, and the evaluator must have specific computer application capabilities.



---

*Source: 3206761-2021-12-31.xml*