방법 비교

	앙상블 의사결정나무	엑스트라 트리 (Extra Trees)
분야	머신러닝	머신러닝
계열	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.