方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 正则化线性回归× | 逻辑回归（机器学习）× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1970–2005 | 1958 |
| 提出者≠ | Hoerl & Kennard (Ridge, 1970); Tibshirani (Lasso, 1996); Zou & Hastie (Elastic Net, 2005) | Cox, D. R. |
| 类型≠ | Penalized linear model | Probabilistic linear classifier |
| 开创性文献≠ | Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ | Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗ |
| 别名 | Ridge regression, Lasso regression, Elastic Net regression, penalized regression | logit model, logit regression, binomial logistic regression, maximum entropy classifier |
| 相关≠ | 4 | 5 |
| 摘要≠ | Regularized linear regression adds a penalty term to the ordinary least-squares objective, shrinking or zeroing out coefficients to reduce overfitting and handle multicollinearity. The three main variants — Ridge (L2 penalty), Lasso (L1 penalty), and Elastic Net (combined L1+L2) — make linear regression usable even when features outnumber observations or predictors are highly correlated. | Logistic regression is a foundational probabilistic classifier that models the log-odds of a binary (or multinomial) outcome as a linear function of the predictors. Introduced by D. R. Cox in 1958, it remains one of the most widely used and interpretable classification methods in both statistics and machine learning, valued for its calibrated probability outputs and clear coefficient interpretation. |
| ScholarGate数据集 ↗ |
|
|