Metraipolis › archive › dc_02802c4e7603

AdaBoost — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/AdaBoost
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-07T12:20:00.705Z
SHA-256 of the archived text
9cbd1746be2ebf0d8e35a7799df0f7d0993df2d459179f205361ed742fc2b22c
Stable URL of this page
https://metraipolis.com/documento/dc_02802c4e7603

How to cite

AdaBoost — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/AdaBoost (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_02802c4e7603 (Metraipolis archive dc_02802c4e7603, sha256 9cbd1746be2ebf0d8e35a7799df0f7d0993df2d459179f205361ed742fc2b22c)
BibTeX
@misc{dc02802c4e7603,
  title = {AdaBoost — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/AdaBoost},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_02802c4e7603; sha256 9cbd1746be2ebf0d8e35a7799df0f7d0993df2d459179f205361ed742fc2b22c},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/AdaBoost. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

AdaBoost (short for Adaptive Boosting) is a statistical classification meta-algorithm formulated by Yoav Freund and Robert Schapire in 1995, who won the 2003 Gödel Prize for their work. It can be used in conjunction with many types of learning algorithm to improve performance. The output of multiple weak learners is combined into a weighted sum that represents the final output of the boosted classifier. Usually, AdaBoost is presented for binary classification, although it can be generalized to multiple classes or bounded intervals of real values. AdaBoost is adaptive in the sense that subsequent weak learners (models) are adjusted in favor of instances misclassified by previous models. In some problems, it can be less susceptible to overfitting than other learning algorithms. The individual learners can be weak, but as long as the performance of each one is slightly better than random guessing, the final model can be proven to converge to a strong learner. Although AdaBoost is typically used to combine weak base learners (such as decision stumps), it has been shown to also effectively combine strong base learners (such as deeper decision trees), producing an even more accurate model. Every learning algorithm tends to suit some problem types better than others, and typically has many different parameters and configurations to adjust before it achieves optimal performance on a dataset. AdaBoost (with decision trees as the weak learners) is often referred to as the best out-of-the-box classifier. When used with decision tree learning, information gathered at each stage of the AdaBoost algorithm about the relative 'hardness' of each training sample is fed into the tree-growing algorithm such that later trees tend to focus on harder-to-classify examples.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «AdaBoost» — https://en.wikipedia.org/wiki/AdaBoost
Wikidata Q2823869: «boosting algorithm» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2823869
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/AdaBoost?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1380247235, consultata il 2026-11-07T12:15:46.260Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 9543e52e155b6bf9fed08a03a23b529df639cc3f11cc773c5eb3e065848b5ce7