방법 비교

	적층	결정 트리	랜덤 포레스트
분야	머신러닝	머신러닝	머신러닝
계열	Machine learning	Machine learning	Machine learning
기원 연도	1992	1984	2001
창시자	Wolpert, D.H.	Breiman, Friedman, Olshen & Stone	Breiman, L.
유형	Ensemble (heterogeneous meta-learning)	Recursive partitioning (if-then rules)	Ensemble (bagging of decision trees)
원전	Wolpert, D.H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259.	Breiman, L., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	Stacking (Yığınlama — Meta-Öğrenme), stacked generalization, meta-learning ensemble, super learner	Karar Ağacı (Decision Tree), karar ağacı, classification tree, regression tree	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	5	5	4
요약	Stacking, or stacked generalization, is an ensemble method introduced by David Wolpert in 1992 that combines the outputs of several different base models (Level-0) through a separate meta-model (Level-1). Unlike bagging and boosting, it deliberately uses heterogeneous model types, and it is the standard final-stage strategy in Kaggle competitions.	A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.	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.