jueves, 13 de febrero de 2020

A greedy stacking algorithm for model ensembling and domain weighting | BMC Research Notes | Full Text

A greedy stacking algorithm for model ensembling and domain weighting | BMC Research Notes | Full Text

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 learne...
Authors:Christoph F. Kurz, Werner Maier and Christian Rink
Citation:BMC Research Notes 2020 13:70
Content type:Research note
Published on: 

No hay comentarios:

Publicar un comentario