Methods for Constructing Predictor Ensembles Based on Convex Combinations
摘要
Abstract
Constructing convex combinations of predictors is an effective method for building ensembles for solving regression problems. Moreover, it seems possible to improve the final quality of the algorithm if the initial set of predictors is constructed in a special way. In this paper, we study two techniques that allow us to achieve such an improvement: bagging in combination with the random subspace method (RSM), and optimization of the divergence of predictors. The effectiveness of the resulting methods is verified in applied problems.