방법 비교

	베이즈 스태킹 앙상블	배깅 (Bootstrap Aggregating)
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2018	1996
창시자	Yao, Y.; Vehtari, A.; Simpson, D.; Gelman, A.	Breiman, L.
유형	Bayesian ensemble combination	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)
원전	Yao, Y., Vehtari, A., Simpson, D., & Gelman, A. (2018). Using stacking to average Bayesian predictive distributions. Bayesian Analysis, 13(3), 917–1007.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.
별칭	Bayesian stacking, Bayesian model stacking, stacking with Bayesian weights, predictive distribution stacking	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor
관련	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.	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.