ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

Robust Bagging×배깅 (Bootstrap Aggregating)×부스팅×
분야머신러닝머신러닝머신러닝
계열Machine learningMachine learningMachine learning
기원 연도1996–2000s19961990–1997
창시자Breiman, L. (bagging); robust variants developed by various authors in 2000sBreiman, L.Schapire, R. E.; Freund, Y.
유형Ensemble (robust bootstrap aggregating)Ensemble meta-algorithm (variance reduction via bootstrap aggregation)Sequential ensemble (iterative reweighting)
원전Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140. DOI ↗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 ↗
별칭robust bootstrap aggregating, robust ensemble bagging, outlier-resistant bagging, robust BAGGingBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble
관련656
요약Robust Bagging extends the classic Bootstrap Aggregating (Bagging) framework by replacing or augmenting standard base learners with robust estimators — or by using robust aggregation rules — so that the ensemble remains accurate even when training data contain outliers, mislabelled instances, or heavy-tailed noise distributions.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데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 3 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Robust Bagging · Bagging · Boosting. 2026-06-17에 다음에서 검색함: https://scholargate.app/ko/compare