A greedy stacking algorithm for model ensembling and domain weighting.

Inhalt

Literaturnachweis - Detailanzeige

Trefferliste

Autor/Urheber	Christoph F. Kurz; Werner Maier; Christian Rink
Institution	BMC
Titel	A greedy stacking algorithm for model ensembling and domain weighting.
Quelle	In: doi:10.1186/s13104-020-4931-7; 1756-0500; BMC Research Notes, Vol 13, Iss 1, Pp 1-6 (2020)(2020) PDF als Volltext kostenfreie Datei
Sprache	englisch
Dokumenttyp	online; Zeitschriftenaufsatz
DOI	10.1186/s13104-020-4931-7
Schlagwörter	Model ensembling; Greedy algorithm; Optimization; Machine learning; Medicine; Biology (General); QH301-705.5; Science (General); Q1-390
Abstract	Abstract 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.
Erfasst von	BASE - Bielefeld Academic Search Engine