Comparar métodos
Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.
| Regresión Lasso× | Máquina de Vectores de Soporte (Clasificación)× | |
|---|---|---|
| Campo | Aprendizaje automático | Aprendizaje automático |
| Familia | Machine learning | Machine learning |
| Año de origen≠ | 1996 | 1995 |
| Autor original≠ | Tibshirani, R. | Cortes, C. & Vapnik, V. |
| Tipo≠ | Regularized linear regression (L1 penalty) | Maximum-margin classifier (kernel method) |
| Fuente seminal≠ | Tibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ | Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297. DOI ↗ |
| Alias | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization | Destek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier |
| Relacionados≠ | 4 | 5 |
| Resumen≠ | 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. | The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data. |
| ScholarGateConjunto de datos ↗ |
|
|