Minimally overfitted learners: A general framework for ensemble learning

doi:10.1016/j.knosys.2022.109669

2022-10-01

Víctor Aceña *

Isaac Martín de Diego

Rubén R. Fernández

Javier M. Moguerza

DOI：10.1016/j.knosys.2022.109669

原文链接

查看原文

摘要

En 中文

The combination of Machine Learning (ML) algorithms is a solution for constructing stronger predictors than a single one. However, some approximations suggest that combining unstable algorithms provides better results than combining stable algorithms. For instance, Generative ensembles, based on re -sampling techniques, have demonstrated high performance by fusing the information of unstable base learners. Random Forest and Gradient Boosting are two well-known examples, both combining Decision Trees and providing better predictions than those obtained using a single tree. However, such successful results have not been achieved by assembling stable algorithms. This paper introduces the notion of limited learner and a new ensemble general framework called Minimally Overfitted Ensemble (MOE), a re-sampling-based ensemble approach that constructs slightly overfitted-based learners. The proposed framework works well with stable and unstable base algorithms, thanks to a Weighted RAndom Bootstrap (WRAB) sampling that provides the necessary diversity for the stable base algorithms. A hyperparameter analysis of the proposal is carried out on artificial data. Besides, its performance is evaluated on real datasets against well-known ML methods. The results confirm that the MOE framework works successfully using stable and unstable base algorithms, improving in most cases the predictive ability of single ML models and other ensemble methods. (C) 2022 The Author(s). Published by Elsevier B.V.

Keyword:

Ensemble

Generative ensembles

Re-sampling

Bagging

Random forest