Сравнение на методи
Прегледайте избраните методи един до друг; редовете с разлики са откроени.
| Регуляризирана линейна регресия× | Логистична регресия (ML)× | |
|---|---|---|
| Област | Машинно обучение | Машинно обучение |
| Семейство | Machine learning | Machine learning |
| Година на възникване≠ | 1970–2005 | 1958 |
| Създател≠ | Hoerl & Kennard (Ridge, 1970); Tibshirani (Lasso, 1996); Zou & Hastie (Elastic Net, 2005) | Cox, D. R. |
| Тип≠ | Penalized linear model | Probabilistic linear classifier |
| Основополагащ източник≠ | 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 ↗ |
| Други названия | Ridge regression, Lasso regression, Elastic Net regression, penalized regression | logit model, logit regression, binomial logistic regression, maximum entropy classifier |
| Свързани≠ | 4 | 5 |
| Резюме≠ | Regularized linear regression adds a penalty term to the ordinary least-squares objective, shrinking or zeroing out coefficients to reduce overfitting and handle multicollinearity. The three main variants — Ridge (L2 penalty), Lasso (L1 penalty), and Elastic Net (combined L1+L2) — make linear regression usable even when features outnumber observations or predictors are highly correlated. | Logistic regression is a foundational probabilistic classifier that models the log-odds of a binary (or multinomial) outcome as a linear function of the predictors. Introduced by D. R. Cox in 1958, it remains one of the most widely used and interpretable classification methods in both statistics and machine learning, valued for its calibrated probability outputs and clear coefficient interpretation. |
| ScholarGateНабор от данни ↗ |
|
|