방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 베이즈 스태킹 앙상블× | Bayesian Model Averaging× | |
|---|---|---|
| 분야≠ | 머신러닝 | 베이지안 |
| 계열≠ | Machine learning | Bayesian methods |
| 기원 연도≠ | 2018 | 1999 |
| 창시자≠ | Yao, Y.; Vehtari, A.; Simpson, D.; Gelman, A. | Hoeting, Madigan, Raftery & Volinsky |
| 유형≠ | Bayesian ensemble combination | Bayesian model averaging |
| 원전≠ | Yao, Y., Vehtari, A., Simpson, D., & Gelman, A. (2018). Using stacking to average Bayesian predictive distributions. Bayesian Analysis, 13(3), 917–1007. 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 ↗ |
| 별칭≠ | Bayesian stacking, Bayesian model stacking, stacking with Bayesian weights, predictive distribution stacking | BMA, Bayesian model combination, Bayesian Model Ortalaması (BMA) |
| 관련≠ | 6 | 5 |
| 요약≠ | Bayesian stacking combines the predictive distributions of several base models by finding non-negative weights that maximise the leave-one-out log predictive score of the mixture. Formalised by Yao, Vehtari, Simpson, and Gelman (2018), it yields a single calibrated predictive distribution that is provably at least as good as any single constituent model under cross-validation. | 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. |
| ScholarGate데이터셋 ↗ |
|
|