방법 비교

	앙상블 선형 회귀	랜덤 포레스트
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1996	2001
창시자	Breiman, L. (bagging framework)	Breiman, L.
유형	Ensemble of linear models	Ensemble (bagging of decision trees)
원전	Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123–140.	Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32.
별칭	bagged linear regression, aggregated linear regression, stacked linear models, bootstrap-aggregated OLS	Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble
관련	6	4
요약	Ensemble Linear Regression combines multiple ordinary least-squares models — each fitted on a different bootstrap sample or feature subset — and averages their predictions. The technique, grounded in Breiman's bagging framework (1996), reduces variance and improves predictive stability compared with a single linear regression fit, while retaining the interpretability of linear assumptions.	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.