ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Povećanje gradijenta×Logistička regresija×
PodručjeStrojno učenjeIstraživačka statistika
ObiteljMachine learningProcess / pipeline
Godina nastanka20011958
TvoracFriedman, J. H.David Roxbee Cox
VrstaEnsemble (sequential boosting of decision trees)Method
Temeljni izvorFriedman, 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 ↗
Drugi naziviGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machinelogit model, binomial logistic regression, LR
Srodne53
SažetakGradient 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.
ScholarGateSkup podataka
  1. v1
  2. 1 Izvori
  3. PUBLISHED
  1. v1
  2. 2 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Gradient Boosting · Logistic Regression. Preuzeto 2026-06-17 s https://scholargate.app/hr/compare