ScholarGate
Ассистент

Сравнение методов

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

Градиентный бустинг×LightGBM×Логистическая регрессия×
ОбластьМашинное обучениеМашинное обучениеСтатистика исследований
СемействоMachine learningMachine learningProcess / pipeline
Год появления200120171958
Автор методаFriedman, J. H.Ke, G. et al. (Microsoft)David Roxbee Cox
ТипEnsemble (sequential boosting of decision trees)Gradient boosting decision tree ensembleMethod
Основополагающий источник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 ↗
Другие названияGradient Boosting (GBM), GBM, gradient boosted trees, gradient boosting machineLightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boostinglogit model, binomial logistic regression, LR
Связанные553
Сводка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.
ScholarGateНабор данных
  1. v1
  2. 1 Источники
  3. PUBLISHED
  1. v1
  2. 1 Источники
  3. PUBLISHED
  1. v1
  2. 2 Источники
  3. PUBLISHED

Перейти к поиску Скачать слайды

ScholarGateСравнение методов: Gradient Boosting · LightGBM · Logistic Regression. Получено 2026-06-19 из https://scholargate.app/ru/compare