विधियों की तुलना करें

	बूस्टिंग एनसेंबल	AdaBoost
क्षेत्र	एन्सेम्बल अधिगम	मशीन अधिगम
परिवार	Machine learning	Machine learning
उद्भव वर्ष	1990	1997
प्रवर्तक	Robert Schapire	Freund, Y. & Schapire, R.E.
प्रकार	sequential ensemble	Ensemble (sequential boosting of weak learners)
मौलिक स्रोत	Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5(2), 197-227.	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.
उपनाम	adaptive boosting, sequential ensemble	AdaBoost (Adaptive Boosting), adaptive boosting, adaptif artırma
संबंधित	4	5
सारांश	Boosting is an ensemble method that sequentially trains weak learners and combines them into a strong predictor by focusing on samples that previous models misclassified. Each new weak learner is weighted according to the difficulty of its training task, and final predictions are made via weighted voting. Pioneered by Schapire (1990) and refined in AdaBoost (Freund & Schapire, 1997), boosting converts weak learners (barely better than random) into strong learners through sequential reweighting.	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.