方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 岭回归（Ridge Regression）× | Lasso 回归× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1970 | 1996 |
| 提出者≠ | Hoerl, A.E. & Kennard, R.W. | Tibshirani, R. |
| 类型≠ | L2-regularized linear regression | Regularized linear regression (L1 penalty) |
| 开创性文献≠ | Hoerl, A.E. & Kennard, R.W. (1970). Ridge Regression: Biased Estimation for Nonorthogonal Problems. Technometrics, 12(1), 55–67. DOI ↗ | Tibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ |
| 别名 | Ridge Regresyonu, ridge regresyonu, L2-regularized regression, Tikhonov regularization | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization |
| 相关 | 4 | 4 |
| 摘要≠ | Ridge Regression is an L2-regularized linear regression method, introduced by Arthur Hoerl and Robert Kennard in 1970, that reduces multicollinearity by adding a penalty on the size of the coefficients. It shrinks coefficients toward zero without setting any of them exactly to zero, producing more stable estimates when predictors are highly correlated. | 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. |
| ScholarGate数据集 ↗ |
|
|