ScholarGate
Assistent

Sammenlign metoder

Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.

Gradient Boosting×Logistisk regression×
FagområdeMaskinlæringForskningsstatistik
FamilieMachine learningProcess / pipeline
Oprindelsesår20011958
OphavspersonFriedman, J. H.David Roxbee Cox
TypeEnsemble (sequential boosting of decision trees)Method
Oprindelig kildeFriedman, 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 ↗
AliasserGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machinelogit model, binomial logistic regression, LR
Relaterede53
Resumé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.
ScholarGateDatasæt
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 2 Kilder
  3. PUBLISHED

Gå til søgning Hent slides

ScholarGateSammenlign metoder: Gradient Boosting · Logistic Regression. Hentet 2026-06-15 fra https://scholargate.app/da/compare