ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

LightGBM×逻辑回归×
领域机器学习研究统计学
方法族Machine learningProcess / pipeline
起源年份20171958
提出者Ke, G. et al. (Microsoft)David Roxbee Cox
类型Gradient boosting decision tree ensembleMethod
开创性文献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 ↗
别名LightGBM, Light Gradient Boosting Machine, lgbm, leaf-wise gradient boostinglogit model, binomial logistic regression, LR
相关53
摘要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. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: LightGBM · Logistic Regression. 于 2026-06-18 检索自 https://scholargate.app/zh/compare