Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Bagging (agregacja bootstrapowa)× | Uśrednianie modeli bayesowskich× | |
|---|---|---|
| Dziedzina≠ | Uczenie maszynowe | Statystyka bayesowska |
| Rodzina≠ | Machine learning | Bayesian methods |
| Rok powstania≠ | 1996 | 1999 |
| Twórca≠ | Breiman, L. | Hoeting, Madigan, Raftery & Volinsky |
| Typ≠ | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) | Bayesian model averaging |
| Źródło pierwotne≠ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ | Hoeting, J. A., Madigan, D., Raftery, A. E. & Volinsky, C. T. (1999). Bayesian Model Averaging: A Tutorial. Statistical Science, 14(4), 382–401. link ↗ |
| Inne nazwy≠ | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor | BMA, Bayesian model combination, Bayesian Model Ortalaması (BMA) |
| Pokrewne | 5 | 5 |
| Podsumowanie≠ | Bagging, short for Bootstrap Aggregating, is an ensemble meta-algorithm introduced by Leo Breiman in 1996 that trains multiple copies of a base learner on independently drawn bootstrap samples of the training data and combines their predictions — by averaging for regression or majority vote for classification — to produce a final predictor with substantially lower variance than any single base learner. | Bayesian Model Averaging (BMA), formalised as a tutorial by Hoeting, Madigan, Raftery and Volinsky in 1999, addresses model uncertainty by averaging over all plausible model specifications rather than selecting a single best model. Each candidate model receives a posterior probability that reflects how well it fits the data given a prior, and predictions or coefficient estimates are formed as weighted averages across the entire model space. This approach reduces the bias and overconfidence that arise when a single selected model is treated as the true one. |
| ScholarGateZbiór danych ↗ |
|
|