방법 비교

	로버스트 스태킹 앙상블	랜덤 포레스트
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1992 (stacking); robust variants 2000s–present	2001
창시자	Wolpert, D. H. (stacking); robust extensions by multiple authors	Breiman, L.
유형	Ensemble (stacking with robust meta-learner)	Ensemble (bagging of decision trees)
원전	Wolpert, D. H. (1992). Stacked Generalization. Neural Networks, 5(2), 241–259.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	robust stacking, robust stacked generalization, outlier-resistant stacking, stacking with robust meta-learner	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	5	4
요약	Robust Stacking Ensemble extends classical stacked generalization by replacing the ordinary meta-learner with a robust estimator — such as a Huber-loss regressor, quantile regression, or a model trained on trimmed residuals — so that the ensemble's combination layer is resistant to outliers and noisy base-learner predictions. It improves predictive accuracy and reliability on real-world datasets with contaminated labels or heavy-tailed error distributions.	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.