Bandingkan metode
Tinjau metode pilihan Anda berdampingan; baris yang berbeda akan disorot.
| Peningkatan Gradien× | Regresi Logistik× | |
|---|---|---|
| Bidang≠ | Pembelajaran Mesin | Statistika Penelitian |
| Keluarga≠ | Machine learning | Process / pipeline |
| Tahun asal≠ | 2001 | 1958 |
| Pencetus≠ | Friedman, J. H. | David Roxbee Cox |
| Tipe≠ | Ensemble (sequential boosting of decision trees) | Method |
| Sumber perintis≠ | Friedman, J. H. (2001). Greedy Function Approximation: A Gradient Boosting Machine. Annals of Statistics, 29(5), 1189–1232. DOI ↗ | Cox, D. R. (1958). The regression analysis of binary sequences. Journal of the Royal Statistical Society, Series B, 20(2), 215–242. DOI ↗ |
| Alias≠ | Gradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machine | logit model, binomial logistic regression, LR |
| Terkait≠ | 5 | 3 |
| Ringkasan≠ | 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. | 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. |
| ScholarGateSet data ↗ |
|
|