Comparar métodos
Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.
| Análisis de Componentes Principales× | Regresión Lasso× | |
|---|---|---|
| Campo | Aprendizaje automático | Aprendizaje automático |
| Familia | Machine learning | Machine learning |
| Año de origen≠ | 2002 | 1996 |
| Autor original≠ | Jolliffe, I.T. (textbook); Pearson & Hotelling (origins) | Tibshirani, R. |
| Tipo≠ | Unsupervised dimensionality reduction | Regularized linear regression (L1 penalty) |
| Fuente seminal≠ | Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. 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 | Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization |
| Relacionados≠ | 3 | 4 |
| Resumen≠ | Principal Component Analysis (PCA) is an unsupervised dimensionality-reduction method — given its modern textbook treatment by Ian Jolliffe (2002) — that compresses high-dimensional data into fewer dimensions while preserving the maximum possible variance. It re-expresses correlated variables as a small set of uncorrelated principal components ordered by how much of the data's variation each one captures. | 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. |
| ScholarGateConjunto de datos ↗ |
|
|