Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Régression Robuste× | Régression Lasso× | |
|---|---|---|
| Domaine≠ | Statistique | Apprentissage automatique |
| Famille≠ | Regression model | Machine learning |
| Année d'origine≠ | 1964 | 1996 |
| Auteur d'origine≠ | Peter J. Huber (M-estimation, 1964); Frank Hampel (influence function, 1974) | Tibshirani, R. |
| Type≠ | Regression with outlier resistance | Regularized linear regression (L1 penalty) |
| Source fondatrice≠ | Huber, P. J. (1964). Robust estimation of a location parameter. The Annals of Mathematical Statistics, 35(1), 73–101. 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 | M-estimation regression, robust linear regression, outlier-resistant regression, MM-estimation | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization |
| Apparentées≠ | 6 | 4 |
| Résumé≠ | Robust regression estimates the linear relationship between a continuous outcome and predictors while sharply reducing the influence of outliers and leverage points. Unlike OLS, which is highly sensitive to extreme observations, robust methods assign down-weighted influence to atypical data points, producing coefficient estimates that remain stable even when a fraction of the data is contaminated or non-normally distributed. | 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. |
| ScholarGateJeu de données ↗ |
|
|