ScholarGate
Assistent

Sammenlign metoder

Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.

AdaBoost×Beslutningstre×LightGBM×
FagfeltMaskinlæringMaskinlæringMaskinlæring
FamilieMachine learningMachine learningMachine learning
Opprinnelsesår199719842017
OpphavspersonFreund, Y. & Schapire, R.E.Breiman, Friedman, Olshen & StoneKe, G. et al. (Microsoft)
TypeEnsemble (sequential boosting of weak learners)Recursive partitioning (if-then rules)Gradient boosting decision tree ensemble
Opprinnelig kildeFreund, 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 ↗Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q. & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems (NeurIPS) 30, 3146–3154. link ↗
AliasAdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırmaKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting
Relaterte555
SammendragAdaBoost (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.LightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy.
ScholarGateDatasett
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED

Gå til søk Last ned lysbilder

ScholarGateSammenlign metoder: AdaBoost · Decision Tree · LightGBM. Hentet 2026-06-18 fra https://scholargate.app/no/compare