随机森林
算法
弹性网正则化
计算机科学
蒙特卡罗方法
Boosting(机器学习)
还原(数学)
回归
数学
统计
数据挖掘
数学优化
人工智能
几何学
作者
Zari Farhadi,Hossein Bevrani,Mohammad‐Reza Feizi‐Derakhshi
标识
DOI:10.1080/03610918.2022.2150779
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI