방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 배깅 (Bootstrap Aggregating)× | 적층× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1996 | 1992 |
| 창시자≠ | Breiman, L. | Wolpert, D.H. |
| 유형≠ | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) | Ensemble (heterogeneous meta-learning) |
| 원전≠ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ | Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗ |
| 별칭 | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor | Stacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner |
| 관련 | 5 | 5 |
| 요약≠ | 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. | Stacking, or stacked generalization, is an ensemble method introduced by David Wolpert in 1992 that combines the outputs of several different base models (Level-0) through a separate meta-model (Level-1). Unlike bagging and boosting, it deliberately uses heterogeneous model types, and it is the standard final-stage strategy in Kaggle competitions. |
| ScholarGate데이터셋 ↗ |
|
|