ScholarGate
Assistent
Machine learningMachine learning

Boosting

Boosting er en sekventiel ensemble-teknik, der omdanner mange simple, knap bedre end tilfældige lærende til en enkelt, meget nøjagtig model ved gentagne gange at fokusere træningen på de eksempler, som tidligere lærende fik fejl af, og derefter kombinere alle lærende med vægte, der er proportionale med deres individuelle nøjagtighed.

Åbn i MethodMindSnartVideoSnartDownload slides

Læs hele metoden

Kun for medlemmer

Log ind med en gratis konto for at læse dette afsnit.

Log ind

Method map

The neighbourhood of related methods — select a node to explore.

+29 more

Kilder

  1. Freund, 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: 10.1006/jcss.1997.1504
  2. Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5(2), 197–227. DOI: 10.1007/BF00116037

Sådan citerer du denne side

ScholarGate. (2026, June 3). Boosting (Ensemble of Sequentially Weighted Weak Learners). ScholarGate. https://scholargate.app/da/machine-learning/boosting

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

Compare side by side

Refereret af

ScholarGateBoosting (Boosting (Ensemble of Sequentially Weighted Weak Learners)). Hentet 2026-06-15 fra https://scholargate.app/da/machine-learning/boosting · Datasæt: https://doi.org/10.5281/zenodo.20539026