# Construction and Application of College English Blended Teaching System Based on Multidata Fusion

Authors: Aiqin Pan
Journal: Discrete Dynamics in Nature and Society
 (2022)

---

## Abstract

With the rapid development of educational information technology, “online and offline” hybrid teaching has become the main trend of foreign language teaching reform in colleges and universities. The blended teaching mode integrates the traditional teaching mode with modern educational technology and reconstructs the traditional college English teaching mode in the aspects of teaching object, teaching content, teaching method, teaching environment, and teaching evaluation. Based on the multisource data such as students’ learning situation, learning duration, and academic performance, this paper builds a student English learning analysis system that realizes the integration of multisource data, completes the unified processing and analysis of multisource data, and then displays it through the interface. The system helps English teachers to guide students in different degrees according to the students’ English learning situation and academic performance, so that English teachers have a clearer and more comprehensive understanding of students’ learning and living conditions and timely guide students with incorrect learning attitudes, so as to avoid students’ detours.


---

## Body

## 1. Introduction

The blended teaching mode of college English pays more attention to the individuality of the teaching object. In the traditional teaching mode, teachers uniformly organize and arrange the teaching progress and content. Teachers are the main body of teaching, and the learning content is dominated by teachers and professors, while students’ learning interests and individual needs are often ignored [1–3]. However, the development of modern educational technology provides realistic possibilities for the satisfaction of the individual needs of students. Abundant online teaching resources make students’ choices more diversified and close to their personal needs [4,5]. The combination of “online and offline” teaching mode can provide students with more choice space according to the individual needs of students. The hybrid teaching mode realizes the effective combination of classroom teaching and independent learning, meets the personalized learning of students in a multimodal environment, and greatly improves the teaching efficiency and learning effect [6–11]. The teaching content of college English blended teaching mode is closer to reality, richer, and more three-dimensional. In the traditional teaching mode, the teaching content is only based on the selection of established texts, which has a certain lag in time and can not fully reflect the changes in reality. The rich teaching resources on the Internet provide an excellent supplement to traditional teaching and become an important part of the blended teaching content, as well as an important source of materials to cultivate students’ awareness of practical care. Online teaching resources are close to reality and have a variety of topics, covering different fields such as economy, society, culture, and history, enabling students to start from reality and examine the relationship between individuals, society, and the world from a diversified perspective [12–15]. In addition, the development of modern educational technology also promotes the booming of online courses, covering many professional fields, increasing the autonomy of students to choose, and enabling students to choose appropriate online courses according to individual needs as a beneficial extension and supplement of classroom teaching content, thus expanding the breadth and depth of teaching content. Through knowledge acquisition tasks, the blended teaching model encourages students to help each other learn, encourages students and extremely to participate in different forms of learning tasks and in the process of mutual discussion, debate, answer questions, or inspire, in the peer influence of the development of critical thinking ability [15]. The enhancement of interaction also helps to deepen the feelings between students, easy to form a harmonious vice consistent, positive collective atmosphere, so that students promote each other, and common development, and promote students’ moral, intellectual, and physical development in an all-round way. The blended teaching mode of college English realizes the interaction between students and knowledge.Big data teaching refers to the use of big data in teaching by schools and teachers to build an informationized and personalized teaching environment and provide teachers and students with a resource pool to achieve common progress between teachers and students [16–20]. In big data teaching, teachers can use relevant software to build the teaching environment and make full use of the big data function. Teachers categorize the resources that students will use in learning, compile guiding outlines, guide students to establish their own learning garden, and build a ubiquitous learning platform [21–25]. Under the guidance of teachers, students use massive resources to learn actively and use big data to carry out discussions and exchanges to promote their own progress. Big data is to generate a large number of field attribute data with research significance in a relatively short period of time and use the relevant technologies involved in big data to analyze the massive data in order to mine the meaningful information and explore the expanded application of big data in college English teaching.


## 2. Big Data Technology

### 2.1. Hadoop Platform

Hadoop is an open-source framework developed by Apache based on the Java language. It is an open-source implementation of distributed computing framework studied by foreign scholars according to the paper of Google. Users can build Hadoop cluster infrastructure without understanding its underlying principles, make full use of the advantages of distributed high-speed computing, and combine the advantages of Hadoop's large storage to develop applications. As a platform for mining and analyzing massive data, Hadoop involves the following core technologies: HDFS, MapReduce, and YARN. An ecosystem is made up of many different subsystems. In the whole ecosystem, each system framework is only used to solve a certain kind of problem, certainly not all the problems can be solved, and to a certain extent, the whole ecosystem is in a stable and highly available state. Hadoop is a computing platform used to process and analyze large-scale data. Its main task is to store and calculate big data. Hadoop is composed of the distributed file management system (HDFS) and distributed computing system (MapReduce). HDFS supports unified file management on distributed servers. Because the initial data is mixed and unstructured, it has high fault tolerance requirements. It is suitable for storing massive data sets and can be deployed on inexpensive hardware. MapReduce is a parallel processing framework for task decomposition and scheduling. It is suitable for splitting tasks into multiple subtasks and combining the calculation results of massive data sets to speed up data processing. Hadoop is suitable for offline batch data processing with low real-time performance and can be used for offline analysis of massive data, large-scale web information search, and data-intensive parallel computing. Figure1 shows the Hadoop framework.Figure 1
Hadoop framework.


### 2.2. Clustering Algorithm

The clustering algorithm is the most widely used method based on statistical analysis in unsupervised learning, which can be used to explore the division of samples or indicators. The partition method refers to the method of splitting the data set with N sample attributes intoK clusters, each cluster is represented as a cluster, and K is less than N. For a given K value, two conditions are met. First, each data cluster contains at least one record. Secondly, each record can only be grouped into a cluster. Algorithms based on the partition method are generally divided according to distance. A partition-based algorithm is to perform initial cluster clustering on the cleaned data set, divide the data set into K clusters, and then adjust the cluster division through repeated iterative technology, so that the adjusted cluster is more accurate than the previous cluster, that is, to make the data of the same cluster as similar as possible. However, the data of different clusters are irrelevant or separated from each other as far as possible.K-means algorithm is the most commonly used and the most basic and effective method to deal with a large amount of data in an unsupervised learning clustering algorithm. The algorithm uses the partition method to cluster the given N data objects into K groups and makes the samples of the same group have the maximum possible correlation, while the samples of different groups have the maximum possible correlation. The correlation of clusters is calculated using the center of mass obtained from the sample mean of each cluster. The processing process of the K-Means algorithm is particularly easy, and the speed of processing data is also very fast, which is suitable for processing large amounts of data. In addition, the algorithm has nothing to do with the order of data processing. It can divide a large amount of data into several small data sets for processing and then summarize the results. However, in the K-Means algorithm, it is necessary to set an appropriate K value for the data set in advance, and it adopts the method of obtaining K original clustering centers randomly so that the selection of different K values and different clustering centers has a great influence on the clustering result. In addition, the K-Means algorithm is very sensitive to noise data and isolated point data, such as maximum or minimum values which will lead to a large error in the results.The working process of theK-Medoids algorithm is very similar to that of K-Means, but the difference lies in the selection of the initial cluster center. K-Means algorithm mainly adopts the means in the sample data to obtain the initial clustering center, and the clustering center in the cluster is not necessarily the sample point. However, K-Medoids uses the center point in the sample data as the clustering center, which reduces the negative impact caused by noise data to some extent. However, it has a large amount of computation and consumes more system performance compared with the K-Means algorithm.CLARA algorithm is mainly based on sampling to process large sample data. The core idea of the CLARA algorithm is to extract multiple sample sets from a large-scale data set and then use theK-Medoids algorithm to perform cluster analysis on the sampled sample data. The CLARA algorithm does not need to consider the entire dataset but rather extracts a portion of it as a sample dataset. CLARA has the advantage of processing large data sets, but its clustering effect is closely related to the size of the sample set extracted, so it may not get the best result. CLARANS is a combination of sampling technology and PAM technology, which is no longer limited to certain fixed samples but randomly sampled data at each step of the search.


### 2.3. Keyword Extraction Algorithm

The TF-IDF algorithm is a very efficient algorithm for numerical statistics and is used to extract attributes or features that best represent or describe unclassified documents. TF-IDF further emphasizes that it is intended to reflect the relevance of a particular term in a particular document. Relevance means that it is related to the amount of information it provides about the context, be it a sentence, document, or corpus. The most relevant terms are those that help humans better understand the entire document, even without having to read everything. TF-IDF works by assigning weights to each document item, which is reflected in the TF-IDF matrix. The intuition behind TF-IDF is that if a term appears more than once in one or several documents, then that term is relevant or necessary and should have a higher TF-IDF score. However, when a term appears more than once in all or most documents, the term is considered typical and has a low TF-IDF score. TF-IDF algorithm mainly extracts keywords through word frequency statistics, which is a relatively simple algorithm. Term Frequency (TF) refers to the frequency with which a word appears in a text. However, words like “today,” “of,” “yes,” “middle,” and “you” still account for a large proportion of the text. In addition, the situation where multiple words appear in the text for the same number of times also occurs for a long time. Therefore, it is necessary to assign different weights to different words through the inverse document frequency (IDF). To select attributes or features that best represent unclassified documents. TF-IDF algorithm is the product of TF and IDF; that is, the larger the TF-IDF value is, the higher its importance to the document is proved.TF is used to measure the frequency of terms appearing in documents. For the wordti in a document di, TF of ti can be expressed as(1)tfi,j=ni,j∑1knk,j,where ni,j represents the number of times that the word ti appears in document dj, and nk,i represents the number of all words that appear in document dj.IDF is used to measure the importance of terms. When TF is calculated, all terms are considered to be equally important. IDF formula is shown in(2)idfi=logNNi+1,where N represents the total number of documents, Ni represents the number of documents that contain the term t, and Ni + 1 ensures that the denominator is not zero.The common formula of the TF-IDF algorithm is the product of TF and IDF, and the TF-IDF value is the characteristic value of the wordti, as shown in(3)tf−idfti=tfi,j∗idfi=ni,j∑1knk,j∗logNNi+1.


## 2.1. Hadoop Platform

Hadoop is an open-source framework developed by Apache based on the Java language. It is an open-source implementation of distributed computing framework studied by foreign scholars according to the paper of Google. Users can build Hadoop cluster infrastructure without understanding its underlying principles, make full use of the advantages of distributed high-speed computing, and combine the advantages of Hadoop's large storage to develop applications. As a platform for mining and analyzing massive data, Hadoop involves the following core technologies: HDFS, MapReduce, and YARN. An ecosystem is made up of many different subsystems. In the whole ecosystem, each system framework is only used to solve a certain kind of problem, certainly not all the problems can be solved, and to a certain extent, the whole ecosystem is in a stable and highly available state. Hadoop is a computing platform used to process and analyze large-scale data. Its main task is to store and calculate big data. Hadoop is composed of the distributed file management system (HDFS) and distributed computing system (MapReduce). HDFS supports unified file management on distributed servers. Because the initial data is mixed and unstructured, it has high fault tolerance requirements. It is suitable for storing massive data sets and can be deployed on inexpensive hardware. MapReduce is a parallel processing framework for task decomposition and scheduling. It is suitable for splitting tasks into multiple subtasks and combining the calculation results of massive data sets to speed up data processing. Hadoop is suitable for offline batch data processing with low real-time performance and can be used for offline analysis of massive data, large-scale web information search, and data-intensive parallel computing. Figure1 shows the Hadoop framework.Figure 1
Hadoop framework.


## 2.2. Clustering Algorithm

The clustering algorithm is the most widely used method based on statistical analysis in unsupervised learning, which can be used to explore the division of samples or indicators. The partition method refers to the method of splitting the data set with N sample attributes intoK clusters, each cluster is represented as a cluster, and K is less than N. For a given K value, two conditions are met. First, each data cluster contains at least one record. Secondly, each record can only be grouped into a cluster. Algorithms based on the partition method are generally divided according to distance. A partition-based algorithm is to perform initial cluster clustering on the cleaned data set, divide the data set into K clusters, and then adjust the cluster division through repeated iterative technology, so that the adjusted cluster is more accurate than the previous cluster, that is, to make the data of the same cluster as similar as possible. However, the data of different clusters are irrelevant or separated from each other as far as possible.K-means algorithm is the most commonly used and the most basic and effective method to deal with a large amount of data in an unsupervised learning clustering algorithm. The algorithm uses the partition method to cluster the given N data objects into K groups and makes the samples of the same group have the maximum possible correlation, while the samples of different groups have the maximum possible correlation. The correlation of clusters is calculated using the center of mass obtained from the sample mean of each cluster. The processing process of the K-Means algorithm is particularly easy, and the speed of processing data is also very fast, which is suitable for processing large amounts of data. In addition, the algorithm has nothing to do with the order of data processing. It can divide a large amount of data into several small data sets for processing and then summarize the results. However, in the K-Means algorithm, it is necessary to set an appropriate K value for the data set in advance, and it adopts the method of obtaining K original clustering centers randomly so that the selection of different K values and different clustering centers has a great influence on the clustering result. In addition, the K-Means algorithm is very sensitive to noise data and isolated point data, such as maximum or minimum values which will lead to a large error in the results.The working process of theK-Medoids algorithm is very similar to that of K-Means, but the difference lies in the selection of the initial cluster center. K-Means algorithm mainly adopts the means in the sample data to obtain the initial clustering center, and the clustering center in the cluster is not necessarily the sample point. However, K-Medoids uses the center point in the sample data as the clustering center, which reduces the negative impact caused by noise data to some extent. However, it has a large amount of computation and consumes more system performance compared with the K-Means algorithm.CLARA algorithm is mainly based on sampling to process large sample data. The core idea of the CLARA algorithm is to extract multiple sample sets from a large-scale data set and then use theK-Medoids algorithm to perform cluster analysis on the sampled sample data. The CLARA algorithm does not need to consider the entire dataset but rather extracts a portion of it as a sample dataset. CLARA has the advantage of processing large data sets, but its clustering effect is closely related to the size of the sample set extracted, so it may not get the best result. CLARANS is a combination of sampling technology and PAM technology, which is no longer limited to certain fixed samples but randomly sampled data at each step of the search.


## 2.3. Keyword Extraction Algorithm

The TF-IDF algorithm is a very efficient algorithm for numerical statistics and is used to extract attributes or features that best represent or describe unclassified documents. TF-IDF further emphasizes that it is intended to reflect the relevance of a particular term in a particular document. Relevance means that it is related to the amount of information it provides about the context, be it a sentence, document, or corpus. The most relevant terms are those that help humans better understand the entire document, even without having to read everything. TF-IDF works by assigning weights to each document item, which is reflected in the TF-IDF matrix. The intuition behind TF-IDF is that if a term appears more than once in one or several documents, then that term is relevant or necessary and should have a higher TF-IDF score. However, when a term appears more than once in all or most documents, the term is considered typical and has a low TF-IDF score. TF-IDF algorithm mainly extracts keywords through word frequency statistics, which is a relatively simple algorithm. Term Frequency (TF) refers to the frequency with which a word appears in a text. However, words like “today,” “of,” “yes,” “middle,” and “you” still account for a large proportion of the text. In addition, the situation where multiple words appear in the text for the same number of times also occurs for a long time. Therefore, it is necessary to assign different weights to different words through the inverse document frequency (IDF). To select attributes or features that best represent unclassified documents. TF-IDF algorithm is the product of TF and IDF; that is, the larger the TF-IDF value is, the higher its importance to the document is proved.TF is used to measure the frequency of terms appearing in documents. For the wordti in a document di, TF of ti can be expressed as(1)tfi,j=ni,j∑1knk,j,where ni,j represents the number of times that the word ti appears in document dj, and nk,i represents the number of all words that appear in document dj.IDF is used to measure the importance of terms. When TF is calculated, all terms are considered to be equally important. IDF formula is shown in(2)idfi=logNNi+1,where N represents the total number of documents, Ni represents the number of documents that contain the term t, and Ni + 1 ensures that the denominator is not zero.The common formula of the TF-IDF algorithm is the product of TF and IDF, and the TF-IDF value is the characteristic value of the wordti, as shown in(3)tf−idfti=tfi,j∗idfi=ni,j∑1knk,j∗logNNi+1.


## 3. System Design

We build a hybrid English teaching system, analyze the needs of students and teachers in online teaching, and optimize the teaching model. Now, the architecture model of the system is designed, and the architecture model is shown in Figure2 in combination with reasonable technology selection. As can be seen from Figure 2, the system is mainly divided into a data access module, data processing and analysis module, and data display module.Figure 2
Construction of system architecture.


### 3.1. System Structure

HDFS, a distributed file management system on the Hadoop platform, has high throughput and storage capacity of TB and PB levels, requiring only common servers. The HDFS framework can automatically restore the lost core files of the HDFS cluster, thus ensuring the automatic recovery of the lost core files of the HDFS cluster. The system adopts the Hadoop framework to store massive data. This module is used to import a large amount of data of user information into HDFS of the Hadoop platform through the Flume framework, clean the isolated point or missing value data, and then associate and match the user’s performance information and other data with the user’s online log information. This module lays a solid foundation for data preprocessing and data analysis and processing in the data processing module.In the data processing module, the obtained original data is preprocessed, the noise points in the data are removed through data cleaning, integration transformation, weighted normalization, and other operations, and the data is converted into a format suitable for data analysis. Statistical methods are used to analyze users’ online preferences, online duration, and user behavior trajectory, and a clustering algorithm is used to analyze heavy Internet users to judge their impact on students’ class efficiency and exam scores. Finally, the analysis result data is stored in the relational database MySQL through the Hive framework. The data processing and analysis module is the core part of the user behavior analysis system of the whole campus network.The data output module mainly outputs the student information analysis function, involving the student’s favorite plate, the student’s habitual behavior, the student’s ability, and other types of information. In the analysis of student information, the system analyzes students’ behavior habits from different aspects, so as to understand the behavior habits of students in online English education as a whole. Through data analysis and statistics, online teaching helps students to learn English, which is convenient for teachers to have a comprehensive understanding of students’ learning situations. Data output module through visual tools displays pages, etc.; the readability of data analysis output is convenient from different perspectives for students to analyze and timely guide.


### 3.2. Algorithm Optimization

K-Means clustering algorithm selects the original clustering center by random selection, so the clustering result error is generally large, so the accuracy of this algorithm is extremely low. In order to solve the problem of low accuracy, this paper makes full use of the improved K-Means algorithm to solve the problem of low accuracy of K-Means. The biggest difference between the improved K-Means algorithm and the K-Means algorithm is the different selection methods of the initial clustering centers, which is to increase the interval between the initial clustering centers as much as possible so that the distance of each clustering center can be as far as possible. The core idea of the improved K-Means algorithm is that it is assumed that N sample data have been selected as the initial clustering center. Then, when selecting the next clustering center, it is necessary to calculate the interval between other sample points and their selected clustering center first and then take the data sample point with the farthest interval as the clustering center of this time. The detailed calculation steps of the improved K-Means algorithm are shown in Figure 3.Figure 3
ImprovedK-Means algorithm.Since the improvedK-Means algorithm needs to select the initial clustering center through repeated iteration, thus increasing the time cost, the algorithm ensures the distance between K clustering centers as far as possible, thus compensating for the error caused by the random selection of the centroid of the K-Means clustering algorithm.The traditional TF-IDF algorithm is mainly used to extract keywords from the web page text for the whole article, and the statistics are the words with high frequency in the text, which cannot accurately summarize the keywords of the text. Therefore, the algorithm needs to be optimized. Generally speaking, the keywords in the text will be reflected in the title, the first paragraph, the end paragraph, or the summary, such as “in summary,” “summary,” and other important words, so the use of keywords in different positions gives different weight. Considering that the text to extract keywords is mainly web page text, and web page text is mainly the structural features of HTML, tags in HTML can reflect the expression degree of words to the whole text to different degrees, and their weight ratio is also different. Different coefficients are given to words in different positions to improve the accuracy of keyword extraction. The specific steps are as follows:(a)
Enter the web page text collectionC = {c1, c2, c3 ... cn}, web page title text set T = {t1, t2, t3 ... tn}(b)
Make text segmentation, to stop words and other operations(c)
Calculate the weight value of the i-th wordwi,j in the j-th text. If wi,j is included in the corresponding title text tj, increase the weight value. In addition, the weight value of text with different lengths is different. In order to reduce the strong coupling of the TF-IDF algorithm to the TF value, the IDF value is squared to balance the algorithm(d)
Repeat the previous step until the weight value of keywords in each text is calculated, sort, obtain the firstn keywords, and save and record themIn algorithm optimization, the TF value is mainly improved. In addition, in order to balance the algorithm and reduce the dependence of the algorithm on TF, the IDF value is squared.(4)tf−idfti=tfi,j∗idfi=ni,j∑1knk,j1+β∗logNNti+12,where ni,j/∑1knk,j represents the TF value of the word in the text, βni,j/∑1knk,j represents the TF value of the word in the title, and logN/Nti+12 represents the IDF value.When the number of web pages is less than 300 and theβ value is greater than 1.5, the selection of keywords depends too much on keywords in the title, and the accuracy decreases. When the number of pages is between 300 and 600, the value of β is 2. When the web page text number is greater than 600, β value 3 is appropriate. The base coefficient in β value is set to 1, and the coefficient dynamically increases by 1 for every 300 words. The value of TF is expressed by tfi,j, and the calculation formula is as follows.(5)tfi,jwi=tfi,j−cwi+1+αtfi,j−twi,where tfi,j−cwi represents the TF value of the word wi in the text, and tfi,j−twi represents the TF value of the word wi in the title.


### 3.3. Data Access Module Design

The data access module mainly collects data from multiple data sources, transforms the data, and writes the data to the specified storage. If all data is stored on only one server, memory may be insufficient. In addition, once a single point of failure occurs, data may be lost and cannot be recovered. Therefore, the data access module uses a Hadoop cluster to store massive data. The data access module is used to import large data volumes such as student learning logs and traffic logs into HDFS of the Hadoop platform through the Flume framework, perform data cleaning operations on isolated points or missing values, and then associate and match data such as student performance information and student learning log information. The data access module lays a solid foundation for the data preprocessing and data analysis in the data processing module.


### 3.4. Data Processing Module Design

Data preprocessing includes two parts of data preprocessing, including multisource data preprocessing and web content analysis preprocessing. Data preprocessing is due to the fact that the data collected is unlikely to be very regular and all are subject to data errors, inconsistent data, incomplete data, incorrect data formats, and other miscellaneous data. The main purpose of data collation is to organize the jumbled data in the dataset in order to improve the quality of the data. The data collation process is shown in Figure4.Figure 4
Data integration process.After data collation, further data processing is needed. Combined with the characteristics of the original data set and the content of preanalysis, the latitude reduction strategy is adopted in the data reduction module to remove the unimportant data and improve the mining efficiency, and then the data is normalized. The amount of data sets in the system is very large, and different data attributes are different. For learning duration attributes, min-Niax standardization is used to transform them, and for IP field attributes, Z-Core standardization is used to transform them, so as to put the data in a small range and maintain the inherent relationship between field attributes. Finally, the weighted normalization of the data makes the data have a good analysis.


### 3.5. Data Output Module Design

It is difficult to find and understand the relationship and rule characteristics between data in data analysis conclusions. Data analysis results can be presented in the form of bar charts, scatter charts, pie charts, etc., so as to observe and analyze the information contained therein more intuitively. The system will have students’ learning preferences, learning hours, analysis of students’ learning habits, and students’ personal portraits through visual display, more intuitive analysis of students’ learning habits, and timely correction of online learning arrangements. The system uses HTML, CSS, JavaScript, and so on to display the front-end interface of multisource data analysis results, mainly through the conventional bar chart, scatter chart, and so on display, so as to analyze the conclusion.


### 3.6. System Environment Setup

The amount of original data used for data mining analysis is relatively large, which may not meet the storage requirements if a single machine is used and even lead to poor computing performance. Linux server is adopted to mine and analyze the large-scale data set collected in the online learning system by using big data-related technology, so as to analyze the students’ learning habits and discover the hidden connections in the data, which can assist the English teaching of teachers and also help to carry out blended learning to mediate and control decisions. In order to complete the construction of the system, a Hadoop cluster is needed. The construction of the Hadoop cluster mainly uses a Linux host server to be more stable and faster, so as to support the requirements of the Hadoop cluster for server performance indicators.


### 3.7. System Implementation

This system mainly uses three servers to build a Hadoop cluster and uses Hive to do big data processing and analysis. The main work of the data access module is to collect and store the students’ learning time and habits in the HDFS file operating system through Flume and store the students’ scores and other types of information in the file server through file uploading. Students’ learning time, learning habits, and basic information uploaded from the front end are mirrored from the system gateway. The data access module mainly conducts data processing according to requirements by analyzing and studying the format of user data acquired, using MapReduce technology. Although MapReduce is a lightweight framework, its performance is especially fast when it runs on hundreds of servers. It can easily process TERabytes of big data and meet the requirements of increasingly massive data visualization and analysis.For the realization of the data processing and analysis module, the data is preprocessed to convert it into a format suitable for analysis, and then the data processing theory and front-end tools are used to analyze the results, mining the characteristics of students’ learning behavior, and find out the students who do not have enough learning time; that is, the learning time is less than the normal learning time. Finally, the results of the study time are not enough for the ranking analysis, to master the situation of students. The system extracts the student account number, online time, learning time, and other data through data preprocessing for further analysis. Through the observation of the data, it is found that each data contains multiple access attribute information. For the current system, not all attributes will be used, and there is some redundant data information. The original data with a large amount of data always has more or less error information or missing information. Therefore, the first step is to clean the initial data, delete the error information in the original data or useless data that cannot reflect students’ behavior, and then transform and standardize the data.To realize data collation, MapReduce can be implemented quickly. Text files are read by line through Java, each line is converted into an array, field formats in each data are screened by regular matching and other methods, and the number of disorderly data is recorded. Finally, the proportion of disorderly data is visualized. Data set may contain a variety of different properties, but for data mining, many properties are superfluous, the original data set is chaotic and wants to have effectiveness analysis of data, and a lot of data attribute is useless, so the system will adopt the way of latitude to reduce redundancy field processing and improve the performance of data analysis and processing.The standardization method adopted in this paper is the commonly used Z-Core method. In addition, due to the different size values of data attributes, the data interval after processing is not fixed, so the data attributes of the original band of the initial data are retained. In addition, the data after data standardization has completed the dimensionalization of the data, and different attribute values have comparability. After data standardization, closely related and noncomparable data can be combined in a weighted way to make the data analytical. MapReduce is used to sort out useless data or error information. Map processing is relatively complex and requires data calculation, while Reduce is the simplest method that does not require any data calculation and only combines the Map calculation results.


## 3.1. System Structure

HDFS, a distributed file management system on the Hadoop platform, has high throughput and storage capacity of TB and PB levels, requiring only common servers. The HDFS framework can automatically restore the lost core files of the HDFS cluster, thus ensuring the automatic recovery of the lost core files of the HDFS cluster. The system adopts the Hadoop framework to store massive data. This module is used to import a large amount of data of user information into HDFS of the Hadoop platform through the Flume framework, clean the isolated point or missing value data, and then associate and match the user’s performance information and other data with the user’s online log information. This module lays a solid foundation for data preprocessing and data analysis and processing in the data processing module.In the data processing module, the obtained original data is preprocessed, the noise points in the data are removed through data cleaning, integration transformation, weighted normalization, and other operations, and the data is converted into a format suitable for data analysis. Statistical methods are used to analyze users’ online preferences, online duration, and user behavior trajectory, and a clustering algorithm is used to analyze heavy Internet users to judge their impact on students’ class efficiency and exam scores. Finally, the analysis result data is stored in the relational database MySQL through the Hive framework. The data processing and analysis module is the core part of the user behavior analysis system of the whole campus network.The data output module mainly outputs the student information analysis function, involving the student’s favorite plate, the student’s habitual behavior, the student’s ability, and other types of information. In the analysis of student information, the system analyzes students’ behavior habits from different aspects, so as to understand the behavior habits of students in online English education as a whole. Through data analysis and statistics, online teaching helps students to learn English, which is convenient for teachers to have a comprehensive understanding of students’ learning situations. Data output module through visual tools displays pages, etc.; the readability of data analysis output is convenient from different perspectives for students to analyze and timely guide.


## 3.2. Algorithm Optimization

K-Means clustering algorithm selects the original clustering center by random selection, so the clustering result error is generally large, so the accuracy of this algorithm is extremely low. In order to solve the problem of low accuracy, this paper makes full use of the improved K-Means algorithm to solve the problem of low accuracy of K-Means. The biggest difference between the improved K-Means algorithm and the K-Means algorithm is the different selection methods of the initial clustering centers, which is to increase the interval between the initial clustering centers as much as possible so that the distance of each clustering center can be as far as possible. The core idea of the improved K-Means algorithm is that it is assumed that N sample data have been selected as the initial clustering center. Then, when selecting the next clustering center, it is necessary to calculate the interval between other sample points and their selected clustering center first and then take the data sample point with the farthest interval as the clustering center of this time. The detailed calculation steps of the improved K-Means algorithm are shown in Figure 3.Figure 3
ImprovedK-Means algorithm.Since the improvedK-Means algorithm needs to select the initial clustering center through repeated iteration, thus increasing the time cost, the algorithm ensures the distance between K clustering centers as far as possible, thus compensating for the error caused by the random selection of the centroid of the K-Means clustering algorithm.The traditional TF-IDF algorithm is mainly used to extract keywords from the web page text for the whole article, and the statistics are the words with high frequency in the text, which cannot accurately summarize the keywords of the text. Therefore, the algorithm needs to be optimized. Generally speaking, the keywords in the text will be reflected in the title, the first paragraph, the end paragraph, or the summary, such as “in summary,” “summary,” and other important words, so the use of keywords in different positions gives different weight. Considering that the text to extract keywords is mainly web page text, and web page text is mainly the structural features of HTML, tags in HTML can reflect the expression degree of words to the whole text to different degrees, and their weight ratio is also different. Different coefficients are given to words in different positions to improve the accuracy of keyword extraction. The specific steps are as follows:(a)
Enter the web page text collectionC = {c1, c2, c3 ... cn}, web page title text set T = {t1, t2, t3 ... tn}(b)
Make text segmentation, to stop words and other operations(c)
Calculate the weight value of the i-th wordwi,j in the j-th text. If wi,j is included in the corresponding title text tj, increase the weight value. In addition, the weight value of text with different lengths is different. In order to reduce the strong coupling of the TF-IDF algorithm to the TF value, the IDF value is squared to balance the algorithm(d)
Repeat the previous step until the weight value of keywords in each text is calculated, sort, obtain the firstn keywords, and save and record themIn algorithm optimization, the TF value is mainly improved. In addition, in order to balance the algorithm and reduce the dependence of the algorithm on TF, the IDF value is squared.(4)tf−idfti=tfi,j∗idfi=ni,j∑1knk,j1+β∗logNNti+12,where ni,j/∑1knk,j represents the TF value of the word in the text, βni,j/∑1knk,j represents the TF value of the word in the title, and logN/Nti+12 represents the IDF value.When the number of web pages is less than 300 and theβ value is greater than 1.5, the selection of keywords depends too much on keywords in the title, and the accuracy decreases. When the number of pages is between 300 and 600, the value of β is 2. When the web page text number is greater than 600, β value 3 is appropriate. The base coefficient in β value is set to 1, and the coefficient dynamically increases by 1 for every 300 words. The value of TF is expressed by tfi,j, and the calculation formula is as follows.(5)tfi,jwi=tfi,j−cwi+1+αtfi,j−twi,where tfi,j−cwi represents the TF value of the word wi in the text, and tfi,j−twi represents the TF value of the word wi in the title.


## 3.3. Data Access Module Design

The data access module mainly collects data from multiple data sources, transforms the data, and writes the data to the specified storage. If all data is stored on only one server, memory may be insufficient. In addition, once a single point of failure occurs, data may be lost and cannot be recovered. Therefore, the data access module uses a Hadoop cluster to store massive data. The data access module is used to import large data volumes such as student learning logs and traffic logs into HDFS of the Hadoop platform through the Flume framework, perform data cleaning operations on isolated points or missing values, and then associate and match data such as student performance information and student learning log information. The data access module lays a solid foundation for the data preprocessing and data analysis in the data processing module.


## 3.4. Data Processing Module Design

Data preprocessing includes two parts of data preprocessing, including multisource data preprocessing and web content analysis preprocessing. Data preprocessing is due to the fact that the data collected is unlikely to be very regular and all are subject to data errors, inconsistent data, incomplete data, incorrect data formats, and other miscellaneous data. The main purpose of data collation is to organize the jumbled data in the dataset in order to improve the quality of the data. The data collation process is shown in Figure4.Figure 4
Data integration process.After data collation, further data processing is needed. Combined with the characteristics of the original data set and the content of preanalysis, the latitude reduction strategy is adopted in the data reduction module to remove the unimportant data and improve the mining efficiency, and then the data is normalized. The amount of data sets in the system is very large, and different data attributes are different. For learning duration attributes, min-Niax standardization is used to transform them, and for IP field attributes, Z-Core standardization is used to transform them, so as to put the data in a small range and maintain the inherent relationship between field attributes. Finally, the weighted normalization of the data makes the data have a good analysis.


## 3.5. Data Output Module Design

It is difficult to find and understand the relationship and rule characteristics between data in data analysis conclusions. Data analysis results can be presented in the form of bar charts, scatter charts, pie charts, etc., so as to observe and analyze the information contained therein more intuitively. The system will have students’ learning preferences, learning hours, analysis of students’ learning habits, and students’ personal portraits through visual display, more intuitive analysis of students’ learning habits, and timely correction of online learning arrangements. The system uses HTML, CSS, JavaScript, and so on to display the front-end interface of multisource data analysis results, mainly through the conventional bar chart, scatter chart, and so on display, so as to analyze the conclusion.


## 3.6. System Environment Setup

The amount of original data used for data mining analysis is relatively large, which may not meet the storage requirements if a single machine is used and even lead to poor computing performance. Linux server is adopted to mine and analyze the large-scale data set collected in the online learning system by using big data-related technology, so as to analyze the students’ learning habits and discover the hidden connections in the data, which can assist the English teaching of teachers and also help to carry out blended learning to mediate and control decisions. In order to complete the construction of the system, a Hadoop cluster is needed. The construction of the Hadoop cluster mainly uses a Linux host server to be more stable and faster, so as to support the requirements of the Hadoop cluster for server performance indicators.


## 3.7. System Implementation

This system mainly uses three servers to build a Hadoop cluster and uses Hive to do big data processing and analysis. The main work of the data access module is to collect and store the students’ learning time and habits in the HDFS file operating system through Flume and store the students’ scores and other types of information in the file server through file uploading. Students’ learning time, learning habits, and basic information uploaded from the front end are mirrored from the system gateway. The data access module mainly conducts data processing according to requirements by analyzing and studying the format of user data acquired, using MapReduce technology. Although MapReduce is a lightweight framework, its performance is especially fast when it runs on hundreds of servers. It can easily process TERabytes of big data and meet the requirements of increasingly massive data visualization and analysis.For the realization of the data processing and analysis module, the data is preprocessed to convert it into a format suitable for analysis, and then the data processing theory and front-end tools are used to analyze the results, mining the characteristics of students’ learning behavior, and find out the students who do not have enough learning time; that is, the learning time is less than the normal learning time. Finally, the results of the study time are not enough for the ranking analysis, to master the situation of students. The system extracts the student account number, online time, learning time, and other data through data preprocessing for further analysis. Through the observation of the data, it is found that each data contains multiple access attribute information. For the current system, not all attributes will be used, and there is some redundant data information. The original data with a large amount of data always has more or less error information or missing information. Therefore, the first step is to clean the initial data, delete the error information in the original data or useless data that cannot reflect students’ behavior, and then transform and standardize the data.To realize data collation, MapReduce can be implemented quickly. Text files are read by line through Java, each line is converted into an array, field formats in each data are screened by regular matching and other methods, and the number of disorderly data is recorded. Finally, the proportion of disorderly data is visualized. Data set may contain a variety of different properties, but for data mining, many properties are superfluous, the original data set is chaotic and wants to have effectiveness analysis of data, and a lot of data attribute is useless, so the system will adopt the way of latitude to reduce redundancy field processing and improve the performance of data analysis and processing.The standardization method adopted in this paper is the commonly used Z-Core method. In addition, due to the different size values of data attributes, the data interval after processing is not fixed, so the data attributes of the original band of the initial data are retained. In addition, the data after data standardization has completed the dimensionalization of the data, and different attribute values have comparability. After data standardization, closely related and noncomparable data can be combined in a weighted way to make the data analytical. MapReduce is used to sort out useless data or error information. Map processing is relatively complex and requires data calculation, while Reduce is the simplest method that does not require any data calculation and only combines the Map calculation results.


## 4. Conclusion

The rapid development of computer technology has brought a new model to college English teaching. Using the K-Means clustering algorithm and weighted technology of information retrieval and data mining, this paper analyzes and processes college students’ English learning habits, learning time, and scores, constructs the system to achieve the initial data in advance screening, and analyzes the basic information for teachers to understand the learning situation, so as to pay more effective and timely attention to the psychological changes of students and quickly make corresponding solutions. The construction of the system provides a new direction for college English blended teaching and enriches the college English teaching model.



---

*Source: 4990844-2022-07-14.xml*