方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| Lasso 回归× | 随机森林× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1996 | 2001 |
| 提出者≠ | Tibshirani, R. | Breiman, L. |
| 类型≠ | Regularized linear regression (L1 penalty) | Ensemble (bagging of decision trees) |
| 开创性文献≠ | Tibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| 别名 | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| 相关 | 4 | 4 |
| 摘要≠ | Lasso regression, introduced by Robert Tibshirani in 1996, is a linear regression method that adds an L1 penalty to the loss so that it shrinks coefficients and performs variable selection at the same time, producing a sparse model. By driving some coefficients exactly to zero it keeps only the predictors that matter. | 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数据集 ↗ |
|
|