مقایسهٔ روشها
روشهای انتخابی خود را کنار هم مرور کنید؛ ردیفهای متفاوت برجسته شدهاند.
| رگرسیون خطی اِنسِمبل (Ensemble Linear Regression)× | جنگل تصادفی× | |
|---|---|---|
| حوزه | یادگیری ماشین | یادگیری ماشین |
| خانواده | 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. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| نامهای دیگر | 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. |
| ScholarGateمجموعهداده ↗ |
|
|