השוואת שיטות

	בוסטינג	עצי-על
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1990–1997	2006
הוגה השיטה	Schapire, R. E.; Freund, Y.	Geurts, P.; Ernst, D.; Wehenkel, L.
סוג	Sequential ensemble (iterative reweighting)	Ensemble (extremely randomized decision trees)
מקור מכונן	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.	Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42.
כינויים	AdaBoost, gradient boosting, iterative reweighting ensemble, sequential ensemble	Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ET
קשורות	6	5
תקציר	Boosting is a sequential ensemble technique that converts many simple, barely-better-than-chance learners into a single highly accurate model by repeatedly focusing training on the examples that previous learners got wrong, then combining all learners with weights proportional to their individual accuracy.	Extra Trees (Extremely Randomized Trees), introduced by Geurts, Ernst, and Wehenkel in 2006, is an ensemble of decision trees that pushes randomisation further than Random Forest. Both the candidate features and the split thresholds are chosen completely at random at each node, eliminating the greedy search over thresholds. This extra randomness reduces variance, often matches or exceeds Random Forest accuracy, and runs substantially faster at training time.