방법 비교

	앙상블 나이브 베이즈	배깅 (Bootstrap Aggregating)
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	2000s	1996
창시자	Various (Dietterich, T.G.; Webb, G.I.; others)	Breiman, L.
유형	Ensemble of probabilistic classifiers	Ensemble meta-algorithm (variance reduction via bootstrap aggregation)
원전	Dietterich, T. G. (2000). Ensemble Methods in Machine Learning. In J. Kittler & F. Roli (Eds.), Multiple Classifier Systems (MCS 2000), Lecture Notes in Computer Science, vol. 1857, pp. 1–15. Springer.	Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140.
별칭	Bagged Naive Bayes, Boosted Naive Bayes, Naive Bayes ensemble, NB ensemble	Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor
관련	6	5
요약	Ensemble Naive Bayes trains multiple Naive Bayes classifiers — each exposed to a different view of the data through bagging, feature subsets, or boosting — and combines their probabilistic predictions by voting or probability averaging. The approach retains the speed and interpretability of individual Naive Bayes models while reducing variance and improving accuracy through ensemble aggregation.	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.