ScholarGate
어시스턴트

방법 비교

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

배깅 (Bootstrap Aggregating)×부스팅×그래디언트 부스팅×
분야머신러닝머신러닝머신러닝
계열Machine learningMachine learningMachine learning
기원 연도19961990–19972001
창시자Breiman, L.Schapire, R. E.; Freund, Y.Friedman, J. H.
유형Ensemble meta-algorithm (variance reduction via bootstrap aggregation)Sequential ensemble (iterative reweighting)Ensemble (sequential boosting of decision trees)
원전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 ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗
별칭Bootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
관련565
요약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.Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost.
ScholarGate데이터셋
  1. v1
  2. 3 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

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

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