PuSH - Publication Server of Helmholtz Zentrum München

Kurz, C.F. ; Maier, W. ; Rink, C.*

A greedy stacking algorithm for model ensembling and domain weighting.

BMC Res. Notes 13:70 (2020)
Publ. Version/Full Text Research data DOI
Open Access Gold
Creative Commons Lizenzvertrag
OBJECTIVE: Because it is impossible to know which statistical learning algorithm performs best on a prediction task, it is common to use stacking methods to ensemble individual learners into a more powerful single learner. Stacking algorithms are usually based on linear models, which may run into problems, especially when predictions are highly correlated. In this study, we develop a greedy algorithm for model stacking that overcomes this issue while still being very fast and easy to interpret. We evaluate our greedy algorithm on 7 different data sets from various biomedical disciplines and compare it to linear stacking, genetic algorithm stacking and a brute force approach in different prediction settings. We further apply this algorithm on a task to optimize the weighting of the single domains (e.g., income, education) that build the German Index of Multiple Deprivation (GIMD) to be highly correlated with mortality. RESULTS: The greedy stacking algorithm provides good ensemble weights and outperforms the linear stacker in many tasks. Still, the brute force approach is slightly superior, but is computationally expensive. The greedy weighting algorithm has a variety of possible applications and is fast and efficient. A python implementation is provided.
Additional Metrics?
Edit extra informations Login
Publication type Article: Journal article
Document type Scientific Article
Keywords Greedy Algorithm ; Machine Learning ; Model Ensembling ; Optimization
e-ISSN 1756-0500
Quellenangaben Volume: 13, Issue: 1, Pages: , Article Number: 70 Supplement: ,
Publisher BioMed Central
Reviewing status Peer reviewed