ScholarGate
Assistent

Jämför metoder

Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.

AdaBoost×Beslutsträd×Gradient Boosting×
ÄmnesområdeMaskininlärningMaskininlärningMaskininlärning
FamiljMachine learningMachine learningMachine learning
Ursprungsår199719842001
UpphovspersonFreund, Y. & Schapire, R.E.Breiman, Friedman, Olshen & StoneFriedman, J. H.
TypEnsemble (sequential boosting of weak learners)Recursive partitioning (if-then rules)Ensemble (sequential boosting of decision trees)
UrsprungskällaFreund, 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 ↗
AliasAdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırmaKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine
Närliggande555
SammanfattningAdaBoost (Adaptive Boosting) is the original boosting algorithm, introduced by Yoav Freund and Robert Schapire in 1997, that combines a sequence of simple weak learners by giving more weight to the observations they get wrong. The forerunner of gradient boosting, it is simple, interpretable, and a strong baseline for classification.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.
ScholarGateDatamängd
  1. v1
  2. 1 Källor
  3. PUBLISHED
  1. v1
  2. 1 Källor
  3. PUBLISHED
  1. v1
  2. 1 Källor
  3. PUBLISHED

Gå till sökningen Ladda ner bildspel

ScholarGateJämför metoder: AdaBoost · Decision Tree · Gradient Boosting. Hämtad 2026-06-18 från https://scholargate.app/sv/compare