Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Ensemble głosujący× | Wzmocnienie× | |
|---|---|---|
| Dziedzina | Uczenie maszynowe | Uczenie maszynowe |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1990s–2004 | 1990–1997 |
| Twórca≠ | Lam & Suen; Kuncheva, L. I. (systematic treatment) | Schapire, R. E.; Freund, Y. |
| Typ≠ | Ensemble (combination of multiple classifiers by vote) | Sequential ensemble (iterative reweighting) |
| Źródło pierwotne≠ | Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8 | Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗ |
| Inne nazwy | majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble |
| Pokrewne≠ | 5 | 6 |
| Podsumowanie≠ | A voting ensemble trains several diverse classifiers independently and combines their predictions by a vote: hard voting picks the class chosen by the most models, while soft voting averages their class-probability estimates, optionally with per-model weights. The combination usually outperforms any individual member, and requires no additional training after the base models are fitted. | Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy. |
| ScholarGateZbiór danych ↗ |
|
|