השוואת שיטות

	עצי-על	יער אקראי
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	2006	2001
הוגה השיטה	Geurts, P.; Ernst, D.; Wehenkel, L.	Breiman, L.
סוג	Ensemble (extremely randomized decision trees)	Ensemble (bagging of decision trees)
מקור מכונן	Geurts, P., Ernst, D. & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 63(1), 3–42.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
כינויים	Extremely Randomized Trees, ExtraTreesClassifier, ExtraTreesRegressor, ET	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
קשורות	5	4
תקציר	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.	Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.