方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| Lasso 回归× | 主成分分析× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1996 | 2002 |
| 提出者≠ | Tibshirani, R. | Jolliffe, I.T. (textbook); Pearson & Hotelling (origins) |
| 类型≠ | Regularized linear regression (L1 penalty) | Unsupervised dimensionality reduction |
| 开创性文献≠ | Tibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ | Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer. DOI ↗ |
| 别名 | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization | Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform |
| 相关≠ | 4 | 3 |
| 摘要≠ | 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. | 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. |
| ScholarGate数据集 ↗ |
|
|