.png){kind=icon}
.png){kind=icon}
Return
SR-Forest: A Genetic Programming-Based Heterogeneous Ensemble Learning Method
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2023.3243172.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Ensemble learning methods have been widely used in machine learning in recent years due to their high-predictive performance. With the development of genetic programming-based symbolic regression (GPSR) methods, many papers begin to choose a popular ensemble learning method, random forests (RFs), as the baseline competitor. Instead of considering them as competitors, an alternative idea might be to consider symbolic regression (SR) as an enhancement technique for RF. GPSR methods which fit a smooth function are complementary to the piecewise nature of decision trees (DTs), as the smooth variation is common in regression problems. In this article, we propose to form an ensemble model with SR-based DTs to address this issue. Furthermore, we design a guided mutation operator to speed up the search on high-dimensional problems, a multifidelity evaluation strategy to reduce the computational cost, and an ensemble selection mechanism to improve predictive performance. Finally, experimental results on a regression benchmark with 120 datasets show that the proposed ensemble model outperforms 25 existing SR and ensemble learning methods. Moreover, the proposed method can provide notable insights on an XGBoost hyperparameter performance prediction task, which is an important application area of ensemble learning methods.
Keywords:
Data models
Ensemble learning
Predictive models
Computational modeling
Task analysis
Boosting
Random forests
Evolutionary feature construction
evolutionary forest (EF)
genetic programming (GP)
random forest (RF)
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W