ScholarGate
Assistent

Jämför metoder

Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.

Lasso-regression×Analys av huvudkomponenter×
ÄmnesområdeMaskininlärningMaskininlärning
FamiljMachine learningMachine learning
Ursprungsår19962002
UpphovspersonTibshirani, R.Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
TypRegularized linear regression (L1 penalty)Unsupervised dimensionality reduction
UrsprungskällaTibshirani, 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 ↗
AliasLASSO Regresyonu, lasso, L1-regularized regression, L1 regularizationTemel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
Närliggande43
SammanfattningLasso 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.
ScholarGateDatamängd
  1. v1
  2. 1 Källor
  3. PUBLISHED
  1. v1
  2. 1 Källor
  3. PUBLISHED

Gå till sökningen Ladda ner bildspel

ScholarGateJämför metoder: Lasso Regression · Principal Component Analysis. Hämtad 2026-06-17 från https://scholargate.app/sv/compare