השוואת שיטות

	עץ החלטה מכלול (Ensemble Decision Tree)	יער אקראי
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	1996–2000	2001
הוגה השיטה	Breiman, L.; Dietterich, T. G.	Breiman, L.
סוג	Ensemble (multiple decision trees combined)	Ensemble (bagging of 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.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
כינויים	decision tree ensemble, ensemble of decision trees, combined decision trees, multiple classifier system (decision trees)	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
קשורות	6	4
תקציר	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.	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.