ScholarGate
Asystent

Porównaj metody

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

Wzmocnienie×Drzewo decyzyjne×Gradient Boosting×
DziedzinaUczenie maszynoweUczenie maszynoweUczenie maszynowe
RodzinaMachine learningMachine learningMachine learning
Rok powstania1990–199719842001
TwórcaSchapire, R. E.; Freund, Y.Breiman, Friedman, Olshen & StoneFriedman, J. H.
TypSequential ensemble (iterative reweighting)Recursive partitioning (if-then rules)Ensemble (sequential boosting of decision trees)
Źródło pierwotneFreund, 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 ↗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 nazwyAdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensembleKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Pokrewne655
PodsumowanieBoosting 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.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. 2 Ź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: Boosting · Decision Tree · Gradient Boosting. Pobrano 2026-06-18 z https://scholargate.app/pl/compare