방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 배깅 (Bootstrap Aggregating)× | 부스팅× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1996 | 1990–1997 |
| 창시자≠ | Breiman, L. | Schapire, R. E.; Freund, Y. |
| 유형≠ | Ensemble meta-algorithm (variance reduction via bootstrap aggregation) | Sequential ensemble (iterative reweighting) |
| 원전≠ | Breiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗ | Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119–139. DOI ↗ |
| 별칭≠ | Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictor | AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble |
| 관련≠ | 5 | 6 |
| 요약≠ | 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. | Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy. |
| ScholarGate데이터셋 ↗ |
|
|