ScholarGate
Assistent

Sammenlign metoder

Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.

AdaBoost×Stacking×
FagområdeMaskinlæringMaskinlæring
FamilieMachine learningMachine learning
Oprindelsesår19971992
OphavspersonFreund, Y. & Schapire, R.E.Wolpert, D.H.
TypeEnsemble (sequential boosting of weak learners)Ensemble (heterogeneous meta-learning)
Oprindelig 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 ↗Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259. DOI ↗
AliasserAdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırmaStacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner
Relaterede55
ResuméAdaBoost (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.Stacking, or stacked generalization, is an ensemble method introduced by David Wolpert in 1992 that combines the outputs of several different base models (Level-0) through a separate meta-model (Level-1). Unlike bagging and boosting, it deliberately uses heterogeneous model types, and it is the standard final-stage strategy in Kaggle competitions.
ScholarGateDatasæt
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 2 Kilder
  3. PUBLISHED

Gå til søgning Hent slides

ScholarGateSammenlign metoder: AdaBoost · Stacking. Hentet 2026-06-15 fra https://scholargate.app/da/compare