方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 正则化支持向量机× | 正则化逻辑回归× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1995–2004 | 1996–2005 |
| 提出者≠ | Cortes, C. & Vapnik, V. (soft-margin SVM); Zhu et al. (L1-SVM) | Tibshirani, R. (lasso); Hoerl & Kennard (ridge); Zou & Hastie (elastic net) |
| 类型≠ | Regularized discriminative classifier / regressor | Penalized classification model |
| 开创性文献≠ | Cortes, C. & Vapnik, V. (1995). Support-vector networks. Machine Learning, 20(3), 273–297. DOI ↗ | Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ |
| 别名 | Regularized SVM, L1-SVM, L2-SVM, penalized SVM | penalized logistic regression, L1 logistic regression, L2 logistic regression, elastic net logistic regression |
| 相关≠ | 4 | 5 |
| 摘要≠ | Regularized Support Vector Machine extends the classic SVM by explicitly controlling the trade-off between margin maximization and training error through an L1 or L2 penalty parameter. The soft-margin formulation introduced by Cortes and Vapnik in 1995 is itself a regularized model, and later L1-SVM variants additionally promote feature sparsity, enabling automatic variable selection in high-dimensional settings. | Regularized logistic regression extends standard logistic regression by adding an L1 (lasso), L2 (ridge), or elastic net penalty to the log-likelihood, shrinking coefficients toward zero and preventing overfitting. It is the default choice for binary or multinomial classification when you want interpretable, sparse, or stable coefficient estimates in high-dimensional or collinear feature spaces. |
| ScholarGate数据集 ↗ |
|
|