השוואת שיטות

	עץ החלטה מכלול (Ensemble Decision Tree)	עצי-על
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1996–2000	2006
הוגה השיטה	Breiman, L.; Dietterich, T. G.	Geurts, P.; Ernst, D.; Wehenkel, L.
סוג	Ensemble (multiple decision trees combined)	Ensemble (extremely randomized decision trees)
מקור מכונן	Dietterich, T. G. (2000). Ensemble methods in machine learning. In Multiple Classifier Systems, Lecture Notes in Computer Science, vol. 1857, pp. 1–15. Springer, Berlin, Heidelberg.	Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42.
כינויים	decision tree ensemble, ensemble of decision trees, combined decision trees, multiple classifier system (decision trees)	Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ET
קשורות	6	5
תקציר	Ensemble Decision Tree methods train multiple decision trees and combine their outputs to produce predictions that are more accurate and stable than any single tree. Covering strategies such as bagging, random subspacing, and voting, they are among the most effective off-the-shelf techniques for tabular classification and regression tasks.	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.