A greedy stacking algorithm for model ensembling and domain weighting
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2020-02-01
|
| Series: | BMC Research Notes |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s13104-020-4931-7 |