방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 엘라스틱 넷 회귀× | 라쏘 회귀× | |
|---|---|---|
| 분야≠ | 통계학 | 머신러닝 |
| 계열≠ | Regression model | Machine learning |
| 기원 연도≠ | 2005 | 1996 |
| 창시자≠ | Hui Zou and Trevor Hastie | Tibshirani, R. |
| 유형≠ | Penalized linear regression | Regularized linear regression (L1 penalty) |
| 원전≠ | Zou, H., & Hastie, T. (2005). Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67(2), 301-320. DOI ↗ | Tibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ |
| 별칭 | elastic net, EN regression, L1+L2 regularized regression, combined lasso-ridge regression | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization |
| 관련≠ | 6 | 4 |
| 요약≠ | Elastic net regression combines the L1 (lasso) and L2 (ridge) penalties into a single regularized regression framework. Controlled by a mixing parameter alpha and a shrinkage strength lambda, it can simultaneously select variables and handle correlated predictors — overcoming key limitations of pure lasso and pure ridge applied alone. | 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데이터셋 ↗ |
|
|