# Analysis of English Writing Text Features Based on Random Forest and Logistic Regression Classification Algorithm

Authors: Chuan Sun; Bo Luo
Journal: Mobile Information Systems
 (2022)

---

## Abstract

The characteristics of English writing text in natural scenes are characterized by low character detection rate, difficulty in small character detection, and various character detection categories. In order to improve the classification effect of English-written texts, solve the problem of feature loss and precision reduction of the prediction model based on dimensionality reduction neural network classifier in the analysis process. An improved stacking model combining random forest and logistic regression is proposed to analyze the characteristics of written English texts. The model uses multiple undersampling, trains multiple random forests as primary classifier, and uses logistic regression as secondary classifier. Experimental results show that this model can effectively improve the classification efficiency of unbalanced text classification. While ensuring the main features, the accuracy of prediction is substantially improved. It is proved that the model has high practicability in analyzing the features of English writing texts.


---

## Body

## 1. Introduction

As the symbol of human civilization and the carrier of information communication, characters exist widely in natural scene images. Compared with other natural scene content in the image, the text in the scene is more logical and general. It can precisely provide high-level semantic information, which is helpful for the analysis and understanding of scene content. The rapid growth of artificial intelligence and deep learning technology provides a new way for the study of end-to-end character detection in natural scenes [1–3].English text writing is a writing form that uses English language as a tool to express thoughts and emotions. English text writing has basic text types such as description, narration, explanation, and discussion, as well as practical text types such as poetry, prose, and story. In fact, underneath these various text forms, there are many text features. Through the digital construction and analysis of these text features, we can have a clear and rational understanding of English writing which helps to improve our English text writing ability [4, 5].For text feature detection in natural scenes, domestic and foreign scholars have carried out relevant studies and achieved certain results [6–9]. The core idea of natural scene text feature detection based on traditional methods is to detect artificially extracted features, such as colour levels and regions. Literature [10] proposed a detection algorithm based on the maximum stable extremum region, but this method could not detect the white text region on a black background. Literature [11] proposed a detection algorithm based on Adaboost, but this method has poor robustness in processing low-contrast images. Literature [12] uses FAST corner point extraction, but it is easily affected by lighting changes and shooting angle. The above traditional natural scene text feature detection methods require manual design features; it would extract many poor features and lead to the loss of recall rate and detection accuracy.With the continuous development of deep learning technology, convolutional neural network (CNN) has made a series of achievements in image classification, object detection, and other fields. Literature [13] proposed a layered detection strategy for text features. Firstly, CNN is used to extract features, and then, random forest algorithm is used to finely classify text feature candidate regions. However, the subsequent processing of this method is usually complicated and cannot achieve the effect of real-time detection. In order to further improve the speed of target detection, literature [14] proposed an end-to-end target detection algorithm, YOLO (You Only Look Once). The algorithm transforms the target detection problem into a regression problem, to better distinguish the target from the background. However, the size of the input image is fixed, which makes it unable to adapt to the shapes of different objects in the training process. The method in Reference [15] adds orientation information, which enables the SSD (single-shot detector) detector to deal with the feature detection problem of text arranged in any direction, but it is not ideal for text with large spacing. The YOLOv2 algorithm proposed in literature [16] uses Darknet-19 network as the feature extraction network, which greatly simplifies the network structure. At the same time, the accuracy of target detection is improved, but its detection effect on text features in natural scenes is poor, and it is easy to mistakenly identify the background as text features.The key to the construction and analysis of the digital model of English writing text features lies in its text classification. Text classification is to obtain information from text, analyze and process the information, and dig out more important knowledge. Text classification is divided into feature engineering and classifier. Feature engineering is the process of turning data into information, which is the most time-consuming and labour-intensive, but quite important process [17]. DF (word frequency), CHI (chi square test), IG (information gain), and ECE (expected cross-entropy) are often used as the basis for feature selection [18]. Literature [19] uses TF-IDF to classify text word segmentation backward quantization as a feature of text. Literature [20] improved feature selection algorithm IG and combined it with DF to extract more important features for texting classification and improving the accuracy of text classification. Classifiers turn information into knowledge, the desired result. The classifier algorithm used for text classification is constantly updated, which makes the prediction effect of text classification better and better. Literature [21] uses naive Bayesian as a classifier to classify short texts, which had achieved good results. Literature [22] uses support vector machine to classify short texts and proves its effectiveness.In the process of feature analysis of English-written texts, in order to improve the classification effect of English-written texts, solve the problem of feature loss and precision decline of the prediction model of dimensionally reduced neural network classifier and adapt to high-dimensional unbalanced characteristics of data. In this paper, an improved stacking model combining random forest and logistic regression was proposed by using TF-IDF feature extraction method. It is used to analyze the characteristics of English writing texts. The experimental results show that the effect of text classification in English writing has been improved.The main innovations of this paper are as follows:(1)
The processing effect of high-dimensional unbalanced features of data is better(2)
The problem of feature loss and precision decline of the prediction model of dimensionally reduced neural network classifier is solved(3)
Extracting features of English writing text by TF-IDF feature extraction methodThis paper consists of four main parts, namely, the introduction in the first section, the related work in the second section, the experiment and analysis in the third section, and the conclusion in the fourth section, with the abstract and reference sections.


## 2. Related Work

### 2.1. TF-IDF (Word Frequency-Inverse Document Frequency)

TF-IDF is a statistical method. Its calculation formula isTFwordfrequency×IDFinversedocumentfrequency. It means that the more frequently a word appears in a certain text and the less frequently it appears in all texts, the higher the TFIDF weight of the word is, the more it can represent the text [23].
(1)
TF (word frequency) refers to the frequency with which a certain word appears in all texts(1)TF=ThenumberofoccurrencesofxinacategoryThenumberofallwordsinthatcategory.(2)
IDF (inverse document frequency) is the reciprocal of document frequency, indicating that words frequently appearing in each text will have less influence on all texts [24](2)IDF=logTotalnumberofdocumentsinthecorpusNumberofdocumentswithwordchanges+1.


### 2.2. Feature Dimension Reduction Algorithm

Feature dimension reduction algorithms are usually divided into two categories: unsupervised algorithms represented by PCA and supervised algorithms represented by linear discriminant analysis (LDA). PCA algorithm is usually applied to prediction models, and its main process includes dataset preprocessing, PCA principal component extraction, and prediction model establishment and prediction [25]. The basic principle of PCA algorithm is to construct a k-order matrix (K represents the number of features after sample dimension reduction) by training the feature vector of covariance matrix of dataset. The k-order matrix is a real diagonal matrix, and the eigenvectors corresponding to different eigenvalues are orthogonal. The k-order matrix is the final result of the algorithm. The PCA algorithm process is as follows: Suppose there is a sample set X=x1,x2,⋯,Xn, the covariance matrix 1/nXXT of the dataset was calculated by subtracting the average value of each feature, and the eigenvalue decomposition method was used to calculate the eigenvalue and eigenvector of the covariance matrix. Then, the eigenvalues are sorted and top K is selected, and its eigenvectors are, respectively, used as row vectors to form the eigenvector matrix P. Finally, the original dataset is mapped to the space constructed by the new feature vector; that is, Y=PX.


### 2.3. Random Forests

Random forest is an extension of the bagging integration algorithm. Bagging ensemble is constructed by a decision tree-based classifier, and random attribute selection is introduced in the process of ensemble. That is, each attribute is selected to be added into the training process to ensure the diversity of the base learner and improve the final generalization performance of the model [26].The final decision result of random forest is obtained by the combination of all the decision tree classification results of base classifier. See Figure1. For the classification problem, the voting method is used to decide, and the classification results of each decision tree are statistically voted, and the minority is subject to the majority. For regression problems, the mean value of decision tree classification results is taken as the result of random forest.Figure 1
Schematic diagram of random forest.The advantages of random forest are as follows.(1)
It can process high-dimensional data without feature selection, which is time-consuming and labour-intensive(2)
It is easy to parallelize and it is faster(3)
The most important point is that random forest can balance the errors caused by datasets in dealing with unbalanced datasets [27]


### 2.4. Stacking Integration Algorithm

Stacking is an integrated algorithm that combines several different machine learners together. Different from the integration of voting method, stacking calls the base learner as primary learner and the learner used for combination as secondary learner [28]. The process for stacking is as follows.
(1)
Divide datasetD to train primary learners h1, h2, h3...(2)
Use several primary learners trained to predict the test set onD, respectively. All the predicted results are combined as a secondary training set to train the secondary learner(3)
Use each primary learner to predict the dataset that needs to be predicted initially. Then, average all the predicted results and then use the secondary trainer to predict the predicted results after processing to get the result


### 2.5. Improved Stacking Model Based on Unbalanced Data

(1)
Unbalanced data processing methodsIn dichotomous tests, one kind of samples concerned, that is, a few kinds of samples, is generally regarded as positive, while the other kind is considered as negative. When the sample number of positive class is much smaller than the sample number of negative class, the data in this case is called unbalanced data.Sigmoid binary classification algorithm is essentially a discriminant model based on conditional probability. It is usually a dichotomous method with a threshold value of 0.5, a positive sample is greater than 0.5, and a negative sample is less than 0.5 [29]. The sigmoid function formula in multidimensional feature space is as follows:
(3)bθI=aθNI=11+e−θNI,where θ represents the multidimensional parameter and X is the eigen-space matrix.For dichotomous problems, the conditional probability function of samples and parametersθ can be expressed as follows:
(4)Uj∣I;θ=bθIj1−bθI1−j,where y represents the dichotomous problem output. After the probability function is obtained, the maximum likelihood estimation and logarithm are performed, and the formula is as follows:
(5)ρθ=logLθ=∑x=1wjxlogbIx+1−jxlog1−bIx.The derivative of parameterθ is calculated for Equation (5), and the iterative formula of parameter gradient is as follows:
(6)θy≔θy+αjx−bθIxIyx.Through continuous iteration on the training set, the approximate extreme value of the derivative is obtained, which is called gradient ascent. Finally, the best parameterθ and the available model are obtained.Unbalanced data is usually sampled to change the data distribution to reduce the degree of data imbalance. Sampling methods include oversampling and undersampling. That is to increase the number of subcategory samples or reduce the number of multicategory samples to increase the influence of positive category features on the classifier. However, if the sample is only oversampled, it will easily lead to overfitting of the model. The generalization ability of the model will be reduced if negative class samples are undersampled [30].Therefore, this paper is not limited to the data sampling method, but is combined with the sampling method and make improvements on the algorithm level.


### 2.6. Improved Stacking Model Integrating Random Forest and Logistic Regression

A certain proportion of samples were selected from the negative samples every time, and all positive samples were retained and combined into a training set to train the random forest model in turn. Specific steps include the following: data as much as positive and 5, 10, 16, and 25 times as much as positive samples were randomly selected from the negative class, respectively. A training set was formed with all positive samples, and five random forests were iteratively trained.With different sampling multiples, classifiers with different parameters can be obtained to ensure the diversity of classifiers. The five random forests are used as primary classifiers. Considering the high-dimensional sparsity of TFIDF, logistic regression classifier was selected as the secondary classifier. Figure2 shows part of the improved stacking model.Figure 2
Improved stacking model.


## 2.1. TF-IDF (Word Frequency-Inverse Document Frequency)

TF-IDF is a statistical method. Its calculation formula isTFwordfrequency×IDFinversedocumentfrequency. It means that the more frequently a word appears in a certain text and the less frequently it appears in all texts, the higher the TFIDF weight of the word is, the more it can represent the text [23].
(1)
TF (word frequency) refers to the frequency with which a certain word appears in all texts(1)TF=ThenumberofoccurrencesofxinacategoryThenumberofallwordsinthatcategory.(2)
IDF (inverse document frequency) is the reciprocal of document frequency, indicating that words frequently appearing in each text will have less influence on all texts [24](2)IDF=logTotalnumberofdocumentsinthecorpusNumberofdocumentswithwordchanges+1.


## 2.2. Feature Dimension Reduction Algorithm

Feature dimension reduction algorithms are usually divided into two categories: unsupervised algorithms represented by PCA and supervised algorithms represented by linear discriminant analysis (LDA). PCA algorithm is usually applied to prediction models, and its main process includes dataset preprocessing, PCA principal component extraction, and prediction model establishment and prediction [25]. The basic principle of PCA algorithm is to construct a k-order matrix (K represents the number of features after sample dimension reduction) by training the feature vector of covariance matrix of dataset. The k-order matrix is a real diagonal matrix, and the eigenvectors corresponding to different eigenvalues are orthogonal. The k-order matrix is the final result of the algorithm. The PCA algorithm process is as follows: Suppose there is a sample set X=x1,x2,⋯,Xn, the covariance matrix 1/nXXT of the dataset was calculated by subtracting the average value of each feature, and the eigenvalue decomposition method was used to calculate the eigenvalue and eigenvector of the covariance matrix. Then, the eigenvalues are sorted and top K is selected, and its eigenvectors are, respectively, used as row vectors to form the eigenvector matrix P. Finally, the original dataset is mapped to the space constructed by the new feature vector; that is, Y=PX.


## 2.3. Random Forests

Random forest is an extension of the bagging integration algorithm. Bagging ensemble is constructed by a decision tree-based classifier, and random attribute selection is introduced in the process of ensemble. That is, each attribute is selected to be added into the training process to ensure the diversity of the base learner and improve the final generalization performance of the model [26].The final decision result of random forest is obtained by the combination of all the decision tree classification results of base classifier. See Figure1. For the classification problem, the voting method is used to decide, and the classification results of each decision tree are statistically voted, and the minority is subject to the majority. For regression problems, the mean value of decision tree classification results is taken as the result of random forest.Figure 1
Schematic diagram of random forest.The advantages of random forest are as follows.(1)
It can process high-dimensional data without feature selection, which is time-consuming and labour-intensive(2)
It is easy to parallelize and it is faster(3)
The most important point is that random forest can balance the errors caused by datasets in dealing with unbalanced datasets [27]


## 2.4. Stacking Integration Algorithm

Stacking is an integrated algorithm that combines several different machine learners together. Different from the integration of voting method, stacking calls the base learner as primary learner and the learner used for combination as secondary learner [28]. The process for stacking is as follows.
(1)
Divide datasetD to train primary learners h1, h2, h3...(2)
Use several primary learners trained to predict the test set onD, respectively. All the predicted results are combined as a secondary training set to train the secondary learner(3)
Use each primary learner to predict the dataset that needs to be predicted initially. Then, average all the predicted results and then use the secondary trainer to predict the predicted results after processing to get the result


## 2.5. Improved Stacking Model Based on Unbalanced Data

(1)
Unbalanced data processing methodsIn dichotomous tests, one kind of samples concerned, that is, a few kinds of samples, is generally regarded as positive, while the other kind is considered as negative. When the sample number of positive class is much smaller than the sample number of negative class, the data in this case is called unbalanced data.Sigmoid binary classification algorithm is essentially a discriminant model based on conditional probability. It is usually a dichotomous method with a threshold value of 0.5, a positive sample is greater than 0.5, and a negative sample is less than 0.5 [29]. The sigmoid function formula in multidimensional feature space is as follows:
(3)bθI=aθNI=11+e−θNI,where θ represents the multidimensional parameter and X is the eigen-space matrix.For dichotomous problems, the conditional probability function of samples and parametersθ can be expressed as follows:
(4)Uj∣I;θ=bθIj1−bθI1−j,where y represents the dichotomous problem output. After the probability function is obtained, the maximum likelihood estimation and logarithm are performed, and the formula is as follows:
(5)ρθ=logLθ=∑x=1wjxlogbIx+1−jxlog1−bIx.The derivative of parameterθ is calculated for Equation (5), and the iterative formula of parameter gradient is as follows:
(6)θy≔θy+αjx−bθIxIyx.Through continuous iteration on the training set, the approximate extreme value of the derivative is obtained, which is called gradient ascent. Finally, the best parameterθ and the available model are obtained.Unbalanced data is usually sampled to change the data distribution to reduce the degree of data imbalance. Sampling methods include oversampling and undersampling. That is to increase the number of subcategory samples or reduce the number of multicategory samples to increase the influence of positive category features on the classifier. However, if the sample is only oversampled, it will easily lead to overfitting of the model. The generalization ability of the model will be reduced if negative class samples are undersampled [30].Therefore, this paper is not limited to the data sampling method, but is combined with the sampling method and make improvements on the algorithm level.


## 2.6. Improved Stacking Model Integrating Random Forest and Logistic Regression

A certain proportion of samples were selected from the negative samples every time, and all positive samples were retained and combined into a training set to train the random forest model in turn. Specific steps include the following: data as much as positive and 5, 10, 16, and 25 times as much as positive samples were randomly selected from the negative class, respectively. A training set was formed with all positive samples, and five random forests were iteratively trained.With different sampling multiples, classifiers with different parameters can be obtained to ensure the diversity of classifiers. The five random forests are used as primary classifiers. Considering the high-dimensional sparsity of TFIDF, logistic regression classifier was selected as the secondary classifier. Figure2 shows part of the improved stacking model.Figure 2
Improved stacking model.


## 3. Experiment and Analysis

All models in this paper were trained and tested on a computer with core I5-7500 CPU @3.40 GHz and 64 GB memory. The computer system is Windows 10 professional 64-bit. All models are implemented with MATLAB 2020a Deep Learning Toolbox framework.


### 3.1. The Dataset

This article selects LendingClub lending site (https://www.endingclub.com/info/download-data.action) of the loan customer information as English writing text experiment datasets (Table 1) to 2018 and 2020 loan customer information English text dataset, in which the English-written text contains customers’ static information (such as income, work, family, and conditions) and dynamic information (customers’ historical credit and others).Table 1
English text datasets of loan customer information in 2018 and 2020.
DatasetSample numberAttribute numberFile formatStatistical yearLoanStats_a40540125Csv2018LoanStats_b4053656Csv2020In this paper, Loanamnt, Fundedamnt, and other attributes of the dataset are mainly used for the initial prediction of random forest. And home_own, desc, and other attributes are the attributes of the initial prediction of the multilayer perceptron. Due to the large amount of data, data in 2018 and 2020 were selected for analysis in this paper. The sample number of LoanStats_a dataset is 40540, and the number of attributes is 125. The number of samples in LoanStats_b dataset is 40536, and the number of attributes is 56.


### 3.2. Data Initialization

Firstly, a variety of data preprocessing algorithms are used to remove redundant attributes of data and reduce the number of features. Then, the correlation of each attribute in the dataset is analyzed, the low positive correlation and negative correlation features in the analysis results are removed (that is, redundant features are removed), and the incomplete attribute values related to the results are filled in. After obtaining the available dataset, various algorithms are tested on the dataset. The influence of its performance on the test results before and after feature extraction is investigated, and the obtained data will be used as the theoretical basis for adjusting the structure of the model.The preprocessing of initial data is completed through the following process:(1)
Use the same number of statistical attributes to determine whether it is the unique attribute and delete the unique attribute in the dataset, such as ID, member ID, and subgrade(2)
Process the nonnumeric data in the dataset, remove the “%” in int_rate, keep only its numeric part, and convert to float. Replace all “fully paid” in the loan status attribute with 1. “Charge doff” is replaced with all zeros. All other fields are replaced with Nan. Replace all “n/A” in the dataset with Nan values. Then, delete the Nan sample in the loan status property. Because loan status is a result set, it is not allowed to have a Nan value(3)
Delete attributes or samples that are Nan in the dataset(4)
Process the incomplete value of the object, int, and float attributes in the data item. If the value in the data item is 0 and Nan is empty, it is the missing item. The missing rate (the percentage of missing items in the whole population) is calculated as follows:(7)Missingpct=L−numL,where L represents the length of the target attribute, num, which represents the number of target attributes that are 0.
(5)
After the above data cleaning, calculate the linear correlation coefficient between the attributes of the dataset, and the formula is as follows:(8)rI,J=CovI,JVarIVarJ,where CovX,Y is the covariance of X and Y. VarX is the variance of X. Var (Y) is the variance of Y. X and Y are attributes of the input. Finally, only rX,Y>0.7, rX,Y∈0,1 is retained. An n×n dimensional lower triangular correlation coefficient matrix is obtained from Equation (8), where N is the number of dataset attributes.
(6)
Fill in missing data. Properties of numeric or custom type fill the mean or 1. Properties of object type are randomly selected in the domain of this property. After processing, two datasets feature 1 CSV and feature 2 CSV can be obtained, whose information is listed in Table2Table 2
Dataset information after pretreatment.
DatasetSample numberAttribute numberFile formatStatistical yearFeature 14054042Csv2018Feature 2780026Csv2020The model divides the dataset into two groups (setsS and Z) by attribute. The performance of different algorithms on dataset Z is experimentally observed. The size of the uncertain item set available in the dataset is counted, and the best collocation scheme is selected. After the above work was done, the uncertainties previously on the training set were extracted and trained to update the logistic regression layer parameters of the improved stacking model.


### 3.3. Feature Extraction

The text information in the dataset of this paper is English text, and the processing of English text includes HTML character conversion, data decoding, removal of Stop Word, removal of punctuation marks, removal of emoticons, separation of words stuck together, and removal of URL.Text data belongs to unstructured data, and machines are often unable to conduct operation analysis on such data. In general, they need to be converted into structured data that can be analyzed by machines. Therefore, text data features are vectorized [31]. In text classification, word vector is a commonly used text representation method. The calculation of entry weight often needs to consider:
(1)
The more frequently a word appears in a document, the greater its contribution to text recognition(2)
The fewer times a word appears in all documents, the better it can distinguish between different documentsTFIDF takes both into account. In this paper, all the words in the comments are put into the TFIDF thesaurus, and then, the TFIDF value is calculated as the entry weight, and the text data is converted into word vector, to carry out classifier training [32].


### 3.4. Experimental Analyses

Before building this model, the performance of MLP, random forest, logistic regression cross-validation (CLF), and logistic regression (LR) algorithms on feature 1 dataset was analyzed separately. Because these results help to better adjust the structure and parameters of the model, finally, one of them was selected to optimize the improved stacking model. In the experimental analysis, PCA algorithm will be added after data pretreatment for comparison. The statistical results show that CLF algorithm and PCA algorithm have a negative effect on the final prediction results of other algorithms. So, consider removing this process in the experiment. The averageF1 values of the 10 times prediction results of the above algorithms on the training set, test set, and test set with PCA process are listed in Table 3. As can be seen from Table 3, there is no obvious difference between the data of each algorithm. In this paper, the differences between them are shown in the form of graphs (Figure 3). In order to increase the gap between data, only the parts whose F1 value exceeds 0.8 are shown in Figure 3.Table 3
Average predictedF1 values of different algorithms on the training set and test set.
DatasetCLFLRRandom forestMLPTraining set0.92080.92080.99070.9199Test set0.91590.91590.90530.9145Test set (PCA)0.91610.91580.90090.9009Figure 3
Average predictionF1 value of different algorithms.It is found in the experiment that the two conditional probabilities using logistic regression layer obey Laplace distribution, so penalty is set asL1. Parameter C is the reciprocal of regularization coefficient, representing the degree of regularization. The dataset used by the error correction model has a small sample size and large random factors, resulting in a small degree of regularization. Therefore, parameter C should be set to 1. The fitting intercept parameter indicates whether there is a bias, and it is usually set to true. The max number of iterations is set to 100. The larger the value is, the higher the convergence degree of the cost function is. The parameters of MLP layer in the model are set as follows: The hidden layer is set as 100×200×100, and the activation function is ReLU. The optimizer uses L-BFGS, and the dataset used in the experiment has many attributes. The approximate Hesse matrix needs to be stored in each iteration, which occupies too much storage space and reduces the efficiency of the algorithm. L-BFGS algorithm is an improved algorithm of BFGS algorithm, which only saves the information of the latest m iterations to reduce the storage space of data and improve the efficiency of the algorithm. Use the optimizer to train the weights and biases of the input and output layers.After the above process, the prerequisite conditions for the realization of the prediction of uncertainty are met. Two comparison models were introduced: Model 1 was used to predict the stacking using the logistic regression layer parameters already trained in the original stacking model. The experimental results show that the prediction results are not ideal, and the accuracy is less than 20%. Model 2 takes all the uncertainties in the training set as the training set of logistic regression layer to train and update the parameters of logistic regression layer. Experimental results show that the logistic regression layer with updated parameters has good prediction results. Figure4 shows the comparison of error correction results of the above two models.Figure 4
Comparison of error correction results between model 1 and model 2.Figure5 is the result of the experiment. Experimental dataset feature 2 is selected for prediction. Compared with dataset feature 1, this dataset has fewer data attributes. The pretreatment of the same part of the two datasets adopts the processing method of feature 1 dataset. Only the attributes used in the experiment of feature 1 dataset are retained. In the experiment using feature 2 dataset, it is found that if only the traditional prediction method is used, the prediction rate will be lower than that in the initial experiment. This is because the reduction of the dimension of the dataset makes the algorithm unable to extract the influence experimental results in a wider range. However, the performance is better in the process of obtaining uncertainties. Many uncertainties can be obtained in each test, which is conducive to correcting many errors and the error correction rate is good. For the wrong prediction results which are not in the uncertain terms, most of them are from the error of the collected data or the factors outside the dataset. It does not belong to the prediction error caused by incomplete feature attribute of dataset. The factors leading to these errors are more complex, and it is more difficult to correct them. Compared with the cost of the whole algorithm, it no longer has a higher predictive value.Figure 5
Experimental results of the proposed algorithm on different datasets.After a series of structural adjustment and parameter modification of local algorithm, the final model structure is obtained. The overall experimental results of this model show that the algorithm can improve the final prediction efficiency well in various experimental datasets. In general, compared with nonfeature complete datasets, the number of uncertainties obtained from feature complete datasets is smaller. In actual data mining, there are always more or less incomplete and error in the collected data, which provides conditions for the acquisition of uncertain items. Therefore, it can be proved that the idea of separating out the uncertain term and improving it is feasible (the performance is different in different application fields or datasets). Figure5 is the result of 15 tests of this model on feature 1 and feature 2 datasets. The initial classification results of the random forest algorithm before the uncertainty are generated are, respectively, represented by initial prediction 1 and initial prediction 2 in Figure 5.In conclusion, compared with the neural network prediction model based on feature dimensionality reduction, the improved stacking model based on random forest and logistic regression in this paper can analyze practical problems more comprehensively and obtain more reasonable prediction results. An improvement of the model in this paper is that the logistic regression layer of the improved stacking model is no longer used to process the output state of the fully connected layer, but is used to obtain the predicted results of the uncertainties. These uncertainties contain data features that may be ignored by general neural networks. For obvious features in the data, all can be analyzed and processed by the fully connected layer or random forest of the improved stacking model; the classification results can be obtained by simply connecting a softmax or sigmoid classifier at the output location.


## 3.1. The Dataset

This article selects LendingClub lending site (https://www.endingclub.com/info/download-data.action) of the loan customer information as English writing text experiment datasets (Table 1) to 2018 and 2020 loan customer information English text dataset, in which the English-written text contains customers’ static information (such as income, work, family, and conditions) and dynamic information (customers’ historical credit and others).Table 1
English text datasets of loan customer information in 2018 and 2020.
DatasetSample numberAttribute numberFile formatStatistical yearLoanStats_a40540125Csv2018LoanStats_b4053656Csv2020In this paper, Loanamnt, Fundedamnt, and other attributes of the dataset are mainly used for the initial prediction of random forest. And home_own, desc, and other attributes are the attributes of the initial prediction of the multilayer perceptron. Due to the large amount of data, data in 2018 and 2020 were selected for analysis in this paper. The sample number of LoanStats_a dataset is 40540, and the number of attributes is 125. The number of samples in LoanStats_b dataset is 40536, and the number of attributes is 56.


## 3.2. Data Initialization

Firstly, a variety of data preprocessing algorithms are used to remove redundant attributes of data and reduce the number of features. Then, the correlation of each attribute in the dataset is analyzed, the low positive correlation and negative correlation features in the analysis results are removed (that is, redundant features are removed), and the incomplete attribute values related to the results are filled in. After obtaining the available dataset, various algorithms are tested on the dataset. The influence of its performance on the test results before and after feature extraction is investigated, and the obtained data will be used as the theoretical basis for adjusting the structure of the model.The preprocessing of initial data is completed through the following process:(1)
Use the same number of statistical attributes to determine whether it is the unique attribute and delete the unique attribute in the dataset, such as ID, member ID, and subgrade(2)
Process the nonnumeric data in the dataset, remove the “%” in int_rate, keep only its numeric part, and convert to float. Replace all “fully paid” in the loan status attribute with 1. “Charge doff” is replaced with all zeros. All other fields are replaced with Nan. Replace all “n/A” in the dataset with Nan values. Then, delete the Nan sample in the loan status property. Because loan status is a result set, it is not allowed to have a Nan value(3)
Delete attributes or samples that are Nan in the dataset(4)
Process the incomplete value of the object, int, and float attributes in the data item. If the value in the data item is 0 and Nan is empty, it is the missing item. The missing rate (the percentage of missing items in the whole population) is calculated as follows:(7)Missingpct=L−numL,where L represents the length of the target attribute, num, which represents the number of target attributes that are 0.
(5)
After the above data cleaning, calculate the linear correlation coefficient between the attributes of the dataset, and the formula is as follows:(8)rI,J=CovI,JVarIVarJ,where CovX,Y is the covariance of X and Y. VarX is the variance of X. Var (Y) is the variance of Y. X and Y are attributes of the input. Finally, only rX,Y>0.7, rX,Y∈0,1 is retained. An n×n dimensional lower triangular correlation coefficient matrix is obtained from Equation (8), where N is the number of dataset attributes.
(6)
Fill in missing data. Properties of numeric or custom type fill the mean or 1. Properties of object type are randomly selected in the domain of this property. After processing, two datasets feature 1 CSV and feature 2 CSV can be obtained, whose information is listed in Table2Table 2
Dataset information after pretreatment.
DatasetSample numberAttribute numberFile formatStatistical yearFeature 14054042Csv2018Feature 2780026Csv2020The model divides the dataset into two groups (setsS and Z) by attribute. The performance of different algorithms on dataset Z is experimentally observed. The size of the uncertain item set available in the dataset is counted, and the best collocation scheme is selected. After the above work was done, the uncertainties previously on the training set were extracted and trained to update the logistic regression layer parameters of the improved stacking model.


## 3.3. Feature Extraction

The text information in the dataset of this paper is English text, and the processing of English text includes HTML character conversion, data decoding, removal of Stop Word, removal of punctuation marks, removal of emoticons, separation of words stuck together, and removal of URL.Text data belongs to unstructured data, and machines are often unable to conduct operation analysis on such data. In general, they need to be converted into structured data that can be analyzed by machines. Therefore, text data features are vectorized [31]. In text classification, word vector is a commonly used text representation method. The calculation of entry weight often needs to consider:
(1)
The more frequently a word appears in a document, the greater its contribution to text recognition(2)
The fewer times a word appears in all documents, the better it can distinguish between different documentsTFIDF takes both into account. In this paper, all the words in the comments are put into the TFIDF thesaurus, and then, the TFIDF value is calculated as the entry weight, and the text data is converted into word vector, to carry out classifier training [32].


## 3.4. Experimental Analyses

Before building this model, the performance of MLP, random forest, logistic regression cross-validation (CLF), and logistic regression (LR) algorithms on feature 1 dataset was analyzed separately. Because these results help to better adjust the structure and parameters of the model, finally, one of them was selected to optimize the improved stacking model. In the experimental analysis, PCA algorithm will be added after data pretreatment for comparison. The statistical results show that CLF algorithm and PCA algorithm have a negative effect on the final prediction results of other algorithms. So, consider removing this process in the experiment. The averageF1 values of the 10 times prediction results of the above algorithms on the training set, test set, and test set with PCA process are listed in Table 3. As can be seen from Table 3, there is no obvious difference between the data of each algorithm. In this paper, the differences between them are shown in the form of graphs (Figure 3). In order to increase the gap between data, only the parts whose F1 value exceeds 0.8 are shown in Figure 3.Table 3
Average predictedF1 values of different algorithms on the training set and test set.
DatasetCLFLRRandom forestMLPTraining set0.92080.92080.99070.9199Test set0.91590.91590.90530.9145Test set (PCA)0.91610.91580.90090.9009Figure 3
Average predictionF1 value of different algorithms.It is found in the experiment that the two conditional probabilities using logistic regression layer obey Laplace distribution, so penalty is set asL1. Parameter C is the reciprocal of regularization coefficient, representing the degree of regularization. The dataset used by the error correction model has a small sample size and large random factors, resulting in a small degree of regularization. Therefore, parameter C should be set to 1. The fitting intercept parameter indicates whether there is a bias, and it is usually set to true. The max number of iterations is set to 100. The larger the value is, the higher the convergence degree of the cost function is. The parameters of MLP layer in the model are set as follows: The hidden layer is set as 100×200×100, and the activation function is ReLU. The optimizer uses L-BFGS, and the dataset used in the experiment has many attributes. The approximate Hesse matrix needs to be stored in each iteration, which occupies too much storage space and reduces the efficiency of the algorithm. L-BFGS algorithm is an improved algorithm of BFGS algorithm, which only saves the information of the latest m iterations to reduce the storage space of data and improve the efficiency of the algorithm. Use the optimizer to train the weights and biases of the input and output layers.After the above process, the prerequisite conditions for the realization of the prediction of uncertainty are met. Two comparison models were introduced: Model 1 was used to predict the stacking using the logistic regression layer parameters already trained in the original stacking model. The experimental results show that the prediction results are not ideal, and the accuracy is less than 20%. Model 2 takes all the uncertainties in the training set as the training set of logistic regression layer to train and update the parameters of logistic regression layer. Experimental results show that the logistic regression layer with updated parameters has good prediction results. Figure4 shows the comparison of error correction results of the above two models.Figure 4
Comparison of error correction results between model 1 and model 2.Figure5 is the result of the experiment. Experimental dataset feature 2 is selected for prediction. Compared with dataset feature 1, this dataset has fewer data attributes. The pretreatment of the same part of the two datasets adopts the processing method of feature 1 dataset. Only the attributes used in the experiment of feature 1 dataset are retained. In the experiment using feature 2 dataset, it is found that if only the traditional prediction method is used, the prediction rate will be lower than that in the initial experiment. This is because the reduction of the dimension of the dataset makes the algorithm unable to extract the influence experimental results in a wider range. However, the performance is better in the process of obtaining uncertainties. Many uncertainties can be obtained in each test, which is conducive to correcting many errors and the error correction rate is good. For the wrong prediction results which are not in the uncertain terms, most of them are from the error of the collected data or the factors outside the dataset. It does not belong to the prediction error caused by incomplete feature attribute of dataset. The factors leading to these errors are more complex, and it is more difficult to correct them. Compared with the cost of the whole algorithm, it no longer has a higher predictive value.Figure 5
Experimental results of the proposed algorithm on different datasets.After a series of structural adjustment and parameter modification of local algorithm, the final model structure is obtained. The overall experimental results of this model show that the algorithm can improve the final prediction efficiency well in various experimental datasets. In general, compared with nonfeature complete datasets, the number of uncertainties obtained from feature complete datasets is smaller. In actual data mining, there are always more or less incomplete and error in the collected data, which provides conditions for the acquisition of uncertain items. Therefore, it can be proved that the idea of separating out the uncertain term and improving it is feasible (the performance is different in different application fields or datasets). Figure5 is the result of 15 tests of this model on feature 1 and feature 2 datasets. The initial classification results of the random forest algorithm before the uncertainty are generated are, respectively, represented by initial prediction 1 and initial prediction 2 in Figure 5.In conclusion, compared with the neural network prediction model based on feature dimensionality reduction, the improved stacking model based on random forest and logistic regression in this paper can analyze practical problems more comprehensively and obtain more reasonable prediction results. An improvement of the model in this paper is that the logistic regression layer of the improved stacking model is no longer used to process the output state of the fully connected layer, but is used to obtain the predicted results of the uncertainties. These uncertainties contain data features that may be ignored by general neural networks. For obvious features in the data, all can be analyzed and processed by the fully connected layer or random forest of the improved stacking model; the classification results can be obtained by simply connecting a softmax or sigmoid classifier at the output location.


## 4. Conclusion

In order to further improve the recognition and classification of English writing text features without relying on manual feature extraction, in this paper, an improved stacking model based on random forest and logistic regression classification algorithm is proposed to analyze the characteristics of English-written texts. In this model, multiple undersampling is used to train multiple random forests as the primary classifier, and logistic regression is used as the secondary classifier to obtain the prediction results of uncertain terms. English writing text features fully connected layers or random forest computation analysis and processing with improved stacking models. It is classified by a softmax or sigmoid classifier. Experimental results show that this model can effectively improve the classification efficiency of unbalanced English writing text classification. The prediction accuracy is greatly improved while ensuring the main characteristics. It is proved that the model has high practicability in analyzing the features of English writing texts. In the next step, more data on the use of natural scenes in English writing texts will be collected to further study how to improve the feature recognition and classification of natural scene English writing texts.



---

*Source: 6306025-2022-04-19.xml*