ScholarGate
Asystent

Porównaj metody

Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.

Bagging (agregacja bootstrapowa)×Drzewo decyzyjne×Gradient Boosting×
DziedzinaUczenie maszynoweUczenie maszynoweUczenie maszynowe
RodzinaMachine learningMachine learningMachine learning
Rok powstania199619842001
TwórcaBreiman, L.Breiman, Friedman, Olshen & StoneFriedman, J. H.
TypEnsemble meta-algorithm (variance reduction via bootstrap aggregation)Recursive partitioning (if-then rules)Ensemble (sequential boosting of decision trees)
Źródło pierwotneBreiman, L. (1996). Bagging Predictors. Machine Learning, 24(2), 123–140. DOI ↗Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗
Inne nazwyBootstrap Aggregating, bootstrap aggregation, bagged ensemble, bagged predictorKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Pokrewne555
PodsumowanieBagging, 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.A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.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.
ScholarGateZbiór danych
  1. v1
  2. 3 Źródła
  3. PUBLISHED
  1. v1
  2. 1 Źródła
  3. PUBLISHED
  1. v1
  2. 1 Źródła
  3. PUBLISHED

Przejdź do wyszukiwania Pobierz slajdy

ScholarGatePorównaj metody: Bagging · Decision Tree · Gradient Boosting. Pobrano 2026-06-17 z https://scholargate.app/pl/compare