手法を比較
選択した手法を並べて確認できます。異なる行はハイライト表示されます。
| ロバスト線形回帰× | Lasso回帰× | |
|---|---|---|
| 分野 | 機械学習 | 機械学習 |
| 系統 | Machine learning | Machine learning |
| 提唱年≠ | 1964–1987 | 1996 |
| 提唱者≠ | Huber, P. J.; Rousseeuw, P. J. | Tibshirani, R. |
| 種類≠ | Outlier-resistant supervised regression | Regularized linear regression (L1 penalty) |
| 原典≠ | Huber, P. J. (1964). Robust Estimation of a Location Parameter. 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 ↗ |
| 別名 | robust regression, M-estimator regression, Huber regression, outlier-resistant regression | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization |
| 関連≠ | 5 | 4 |
| 概要≠ | Robust linear regression fits a linear model between predictors and a continuous outcome while down-weighting or discarding influential outliers, preventing the few anomalous observations that OLS is famously sensitive to from distorting the entire estimated line. Major variants include Huber regression, iteratively reweighted least squares (IRLS), RANSAC, and Theil-Sen estimation. | 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. |
| ScholarGateデータセット ↗ |
|
|