방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 라쏘 회귀× | 로지스틱 회귀× | |
|---|---|---|
| 분야≠ | 머신러닝 | 연구 통계 |
| 계열≠ | Machine learning | Process / pipeline |
| 기원 연도≠ | 1996 | 1958 |
| 창시자≠ | Tibshirani, R. | David Roxbee Cox |
| 유형≠ | Regularized linear regression (L1 penalty) | Method |
| 원전≠ | Tibshirani, R. (1996). Regression Shrinkage and Selection via the Lasso. Journal of the Royal Statistical Society: Series B, 58(1), 267–288. DOI ↗ | Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗ |
| 별칭≠ | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization | logit model, binomial logistic regression, LR |
| 관련≠ | 4 | 3 |
| 요약≠ | 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. | Logistic regression is a statistical method for modeling the probability of a binary outcome (disease present/absent, success/failure) as a function of continuous and categorical predictors. Developed by David Roxbee Cox (1958), it solves the problem of predicting categorical outcomes by applying a logistic transformation to constrain predictions to the [0,1] probability interval, enabling accurate risk stratification, diagnostic prediction, and causal inference in epidemiology, medicine, and social science. |
| ScholarGate데이터셋 ↗ |
|
|