ScholarGate
Asystent

Porównaj metody

Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.

Gradient Boosting×Regresja logistyczna×
DziedzinaUczenie maszynoweStatystyka w badaniach
RodzinaMachine learningProcess / pipeline
Rok powstania20011958
TwórcaFriedman, J. H.David Roxbee Cox
TypEnsemble (sequential boosting of decision trees)Method
Źródło pierwotneFriedman, 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 ↗
Inne nazwyGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machinelogit model, binomial logistic regression, LR
Pokrewne53
PodsumowanieGradient 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.
ScholarGateZbiór danych
  1. v1
  2. 1 Źródła
  3. PUBLISHED
  1. v1
  2. 2 Źródła
  3. PUBLISHED

Przejdź do wyszukiwania Pobierz slajdy

ScholarGatePorównaj metody: Gradient Boosting · Logistic Regression. Pobrano 2026-06-17 z https://scholargate.app/pl/compare