Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Gradient Boosting× | LightGBM× | Regresja logistyczna× | |
|---|---|---|---|
| Dziedzina≠ | Uczenie maszynowe | Uczenie maszynowe | Statystyka w badaniach |
| Rodzina≠ | Machine learning | Machine learning | Process / pipeline |
| Rok powstania≠ | 2001 | 2017 | 1958 |
| Twórca≠ | Friedman, J. H. | Ke, G. et al. (Microsoft) | David Roxbee Cox |
| Typ≠ | Ensemble (sequential boosting of decision trees) | Gradient boosting decision tree ensemble | Method |
| Źródło pierwotne≠ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Ke, G., Meng, Q., Finley, T., Wang, T., Chen, W., Ma, W., Ye, Q. & Liu, T.-Y. (2017). LightGBM: A Highly Efficient Gradient Boosting Decision Tree. Advances in Neural Information Processing Systems (NeurIPS) 30, 3146–3154. link ↗ | Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗ |
| Inne nazwy≠ | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boosting | logit model, binomial logistic regression, LR |
| Pokrewne≠ | 5 | 5 | 3 |
| Podsumowanie≠ | Gradient Boosting is an ensemble learning method, formalised by Jerome H. Friedman in 2001, that combines a sequence of weak learners — typically shallow decision trees — so that each new tree is fitted to minimise the residual errors of the trees before it. It is the core algorithm behind popular implementations such as XGBoost, LightGBM and CatBoost. | LightGBM is Microsoft's gradient boosting decision tree implementation, introduced by Ke and colleagues in 2017, that grows trees leaf-wise and bins features into histograms for speed. On large datasets it is much faster than XGBoost while retaining strong predictive accuracy. | 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. |
| ScholarGateZbiór danych ↗ |
|
|
|