Ensemble of fast learning stochastic gradient boosting

DOI10.1080/03610918.2019.1645170MaRDI QIDQ5086335zbMATH OpenOpenAlexFDO

Authors Bin Li, Qingzhao Yu, Lu Peng

Publication date 5 July 2022

Published in Communications in Statistics. Simulation and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610918.2019.1645170

zbMATH Keywords

bias-variance tradeoffboostingensemble methodparallel computingtree

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• Bagging predictors
• Boosting With theL₂Loss
• Greedy function approximation: A gradient boosting machine.
• scientific article; zbMATH DE number 1944955 (Why is no real title available?)
• Matching pursuits with time-frequency dictionaries
• Multivariate adaptive regression splines
• Prediction Games and Arcing Algorithms
• Random forests
• Stochastic gradient boosting.

Cited in

(4)

• Ensemble learning based on approximate reducts and bootstrap sampling
• scientific article; zbMATH DE number 5957419 (Why is no real title available?)
• Randomized Gradient Boosting Machine
• Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications

Describes a project that uses

Uses Software

• ElemStatLearn

This page was built for publication: Ensemble of fast learning stochastic gradient boosting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086335)