ScholarGate
עוזר

השוואת שיטות

סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.

רגרסיית לאסו×ניתוח רכיבים עיקריים×
תחוםלמידת מכונהלמידת מכונה
משפחהMachine learningMachine learning
שנת המקור19962002
הוגה השיטה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 regularizationTemel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
קשורות43
תקציר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מערך נתונים
  1. v1
  2. 1 מקורות
  3. PUBLISHED
  1. v1
  2. 1 מקורות
  3. PUBLISHED

מעבר לחיפוש הורדת מצגת

ScholarGateהשוואת שיטות: Lasso Regression · Principal Component Analysis. אוחזר בתאריך 2026-06-17 מתוך https://scholargate.app/he/compare