방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 강건 릿지 회귀 (Robust Ridge Regression)× | 라쏘 회귀× | |
|---|---|---|
| 분야≠ | 통계학 | 머신러닝 |
| 계열≠ | Regression model | Machine learning |
| 기원 연도≠ | 1991 | 1996 |
| 창시자≠ | Silvapulle (1991); building on Tikhonov (1963) and Huber (1964) | Tibshirani, R. |
| 유형≠ | Regularized robust linear regression | Regularized linear regression (L1 penalty) |
| 원전≠ | Silvapulle, M. J. (1991). Robust ridge regression based on an M-estimator. Australian Journal of Statistics, 33(3), 319–333. link ↗ | Tibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ |
| 별칭 | ridge M-estimation, robust regularized regression, M-estimator ridge, outlier-resistant ridge regression | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization |
| 관련≠ | 5 | 4 |
| 요약≠ | Robust Ridge regression combines M-estimation with L2 (ridge) regularization to produce coefficient estimates that are simultaneously resistant to outliers and stable under multicollinearity. It minimizes a robust loss function (such as Huber's) penalized by the squared norm of the coefficient vector, downweighting influential observations while shrinking correlated predictors toward zero. | 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데이터셋 ↗ |
|
|