Nowadays, in the topics related to prediction, in addition to increasing the accuracy of existing algorithms, the reduction of computational time is a challenging issue that has attracted much attention. Since the existing methods may not have enough efficiency and accuracy, we use a combination of machine-learning algorithms and statistical methods to solve this problem. Furthermore, we reduce the computational time in the testing model by automatically reducing the number of trees using penalized methods and ensembling the remaining trees. We call this efficient combinatorial method “ensemble of clustered and penalized random forest (ECAPRAF)”. This method consists of four fundamental parts. In the first part, k-means clustering is used to identify homogeneous subsets of data and assign them to similar groups. In the second part, a tree-based algorithm is used within each cluster as a predictor model; in this work, random forest is selected. In the next part, penalized methods are used to reduce the number of random-forest trees and remove high-variance trees from the proposed model. This increases model accuracy and decreases the computational time in the test phase. In the last part, the remaining trees within each cluster are combined. The results of the simulation and two real datasets based on the WRMSE criterion show that our proposed method has better performance than the traditional random forest by reducing approximately 12.75%, 11.82%, 12.93%, and 11.68% and selecting 99, 106, 113, and 118 trees for the ECAPRAF–EN algorithm.
Deep learning techniques face the problem of overfitting due to their complex layer structure. Regularization methods are used to overcome this problem and improve the designed models. In this article, we use the combination of L1 regularization, L2 regularization, Elastic Net-regularization, and Dropout methods. The designed deep model using combination of these methods is considered with different rates. The deep network model using a combination of these methods is designed with different rates. Finally, the performance of all combination methods is compared with the Convolutional Neural Network model which does not use regularization methods. Experiments are performed using the Gold price per ounce data set and linear simulation model. The obtained results show that the performance of the combination model of Dropout and Elastic Net regularization is better than the other models.
1
30 November 2022 in Communications in Statistics - Simulation and Computation
This article is improved the random forest algorithm by selecting the most appropriate penalized regression methods, and it is tried to improve the post-selection boosting random forest (PBRF) algorithm using elastic net regression. The proposed method with the highest efficiency is called Reducing and Aggregating Random Forest Trees by Elastic Net (RARTEN). The introduced method consists of three steps. In the first step, the random forest algorithm is used as a predictor. In the second step, Elastic Net, as a penalized regression method, is applied to reduce the number of trees and improve the random forest and PBRF. In the last step, selected trees are aggregated. The obtained results of the real data and Monte Carlo simulation are evaluated using various statistical performance criteria. The simulation study shows that the RARTEN with 7%, 5%, and 8.5% reduction in the linear, nonlinear, and noise model, respectively improve the accuracy of the traditional random forest and the proposed method by Wang. In addition, this method has a significant reduction compared to other penalized regression methods. Moreover, the real data results show that the proposed method in our study with a reduction of almost 16% confirms the validity of the proposed model.
On a daily basis, an abundance of opinions, thousands or even millions of comments are generated by various individuals on social media. Collecting and evaluating these comments using traditional methods and algorithms is accompanied by less accuracy. Therefore, the development of a robust sentiment analysis system is essential for the accurate analysis of users’ sentiments. Current methods have limited accuracy. Therefore, an idea to overcome this limitation is to get benefit of several classifiers together. Ensemble methods, through the combination of several different algorithms with diverse structures, can generate a new framework capable of better analyzing the sentiments. In the present study, an ensemble-based model is introduced to extract meaningful information from Persian comments on the Instagram social media platform. The model is proposed for the classification and prediction of users’ behaviors or emotions across distinct categories. This hybrid model comprises three main phases. The first phase is pre-processing and word embedding. Word2Vec is used for this manner. The second phase consists of four proposed deep models, namely CNN, LSTM, CNN-LSTM, and LSTM-CNN which are used as classifiers. Finally, in the third phase, ensemble techniques like MLP and Voting ensemble are employed to aggregate the results derived from the previous phase. To evaluate the performance of the proposed ensemble-based model, the model is applied to the Insta.csv dataset, containing Persian comments on Instagram. Experimental results demonstrate that the proposed ensemble-based model, utilizing the Voting ensemble, outperforms other ensemble methods. In terms of accuracy, it achieves 72.337%, therefore, the Voting ensemble shows a 4.9% improvement over the MLP ensemble.
In tree-based algorithms like random forest and deep forest, due to the presence of numerous inefficient trees and forests in the model, the computational load increases and the efficiency decreases. To address this issue, in the present paper, a model called Automatic Deep Forest Shrinkage (ADeFS) is proposed based on shrinkage techniques. The purpose of this model is to reduce the number of trees, enhance the efficiency of the gcforest, and reduce computational load. The proposed model comprises four steps. The first step is multi-grained scanning, which carries out a sliding window strategy to scan the input data and extract the relations between features. The second step is cascade forest, which is structured layer-by-layer with a number of forests consisting of random forest (RF) and completely random forest (CRF) within each layer. In the third step, which is the innovation of this paper, shrinkage techniques such as LASSO and elastic net (EN) are employed to decrease the number of trees in the last layer of the previous step, thereby decreasing the computational load, and improving the gcforest performance. Among several shrinkage techniques, elastic net (EN) provides better performance. Finally, in the last step, the simple average ensemble method is employed to combine the remaining trees. The proposed model is evaluated by Monte Carlo simulation and three real datasets. Findings demonstrate the superior performance of the proposed ADeFS-EN model over both gcforest and RF, as well as the combination of RF with shrinkage techniques.
Ensembling is a powerful technique to obtain the most accurate results. In some cases, the large number of learners in ensemble learning mostly increases both computational load during the test phase and error rate. To solve this problem, in this paper we propose an Ensemble of Reduced Deep Regression (ERDeR) model, which is a combination of Deep Regressions (DRs), shrinkage methods, and ensemble approaches. The framework of the proposed model contains three phases. The first phase includes base regressions in which parallel DRs are used as learners. The role of these DRs is to extract features of input data and make prediction. In the second phase, to automatically reduce and select the most suitable DRs, shrinkage methods such as Least Absolute Shrinkage and Selection Operator (LASSO) and Elastic Net (EN) are employed. These models are compared with the non-shrinkage model. The last phase is ensemble phase, which consists of three different ensemble methods namely Multi-Layer Perceptron (MLP), Weighted Average (WA), and Simple Average (SA). These ensemble methods are used to aggregate the remaining learners from previous steps. Finally, the proposed model is applied to Monte Carlo simulation data and three real datasets including Boston House Price, Real Estate Valuation and Gold Price per Ounce. The results show that after applying the shrinkage methods the error rate is significantly reduced and the model accuracy is increased. Accordingly, the results of combining shrinkage methods and ensemble approaches not only decreased the computational load during test phase, but also increased the model accuracy.