Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Regulariserad stödvektormaskin× | Lasso-regression× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1995–2004 | 1996 |
| Upphovsperson≠ | Cortes, C. & Vapnik, V. (soft-margin SVM); Zhu et al. (L1-SVM) | Tibshirani, R. |
| Typ≠ | Regularized discriminative classifier / regressor | Regularized linear regression (L1 penalty) |
| Ursprungskälla≠ | 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 ↗ |
| Alias | Regularized SVM, L1-SVM, L2-SVM, penalized SVM | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization |
| Närliggande | 4 | 4 |
| Sammanfattning≠ | 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. | 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. |
| ScholarGateDatamängd ↗ |
|
|