방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 베이지안 LASSO 회귀× | 라쏘 회귀× | |
|---|---|---|
| 분야≠ | 통계학 | 머신러닝 |
| 계열≠ | Regression model | Machine learning |
| 기원 연도≠ | 2008 | 1996 |
| 창시자≠ | Park & Casella | Tibshirani, R. |
| 유형≠ | Bayesian regularized regression | Regularized linear regression (L1 penalty) |
| 원전≠ | Park, T., & Casella, G. (2008). The Bayesian Lasso. Journal of the American Statistical Association, 103(482), 681–686. DOI ↗ | Tibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ |
| 별칭 | Bayesian LASSO, Bayesian L1 regression, double-exponential prior regression, Laplace prior regression | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization |
| 관련≠ | 5 | 4 |
| 요약≠ | Bayesian LASSO regression places double-exponential (Laplace) priors on regression coefficients, which is the Bayesian analogue of the classical LASSO penalty. It simultaneously shrinks small coefficients toward zero and performs soft variable selection, all within a coherent posterior inference framework that naturally quantifies parameter uncertainty through credible intervals. | 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데이터셋 ↗ |
|
|