Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Regrese Lasso× | Logistická regrese× | Random Forest× | |
|---|---|---|---|
| Obor≠ | Strojové učení | Statistika ve výzkumu | Strojové učení |
| Rodina≠ | Machine learning | Process / pipeline | Machine learning |
| Rok vzniku≠ | 1996 | 1958 | 2001 |
| Tvůrce≠ | Tibshirani, R. | David Roxbee Cox | Breiman, L. |
| Typ≠ | Regularized linear regression (L1 penalty) | Method | Ensemble (bagging of decision trees) |
| Původní zdroj≠ | 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 ↗ | Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗ |
| Další názvy≠ | LASSO Regresyonu, lasso, L1-regularized regression, L1 regularization | logit model, binomial logistic regression, LR | Rastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensemble |
| Příbuzné≠ | 4 | 3 | 4 |
| Shrnutí≠ | 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. | Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree. |
| ScholarGateDatová sada ↗ |
|
|
|