Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Lasso-regression× | Vanligaste minsta kvadratmetoden (OLS) Regression× | |
|---|---|---|
| Ämnesområde≠ | Maskininlärning | Ekonometri |
| Familj≠ | Machine learning | Regression model |
| Ursprungsår≠ | 1996 | 2019 |
| Upphovsperson≠ | Tibshirani, R. | Wooldridge (textbook treatment); classical least squares |
| Typ≠ | Regularized linear regression (L1 penalty) | Linear regression |
| Ursprungskälla≠ | Tibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ | Wooldridge, J. M. (2019). Introductory Econometrics: A Modern Approach (7th ed.). Cengage Learning. ISBN: 978-1337558860 |
| Alias | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization | ordinary least squares, classical linear regression, linear regression, en küçük kareler regresyonu |
| Närliggande≠ | 4 | 5 |
| Sammanfattning≠ | 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. | Ordinary Least Squares is the classical linear regression method that explains a continuous outcome as a linear combination of predictors. It estimates the coefficients by minimising the sum of squared residuals, and under the Gauss-Markov assumptions these estimates are the best linear unbiased estimator (BLUE). |
| ScholarGateDatamängd ↗ |
|
|