Abstract
So far, we’ve considered decision trees and random forest algorithms. We saw that random forest is a bagging (bootstrap aggregating) algorithm—it combines the output of multiple decision trees to give the prediction. Typically, in a bagging algorithm trees are grown in parallel to get the average prediction across all trees, where each tree is built on a sample of original data.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 V Kishore Ayyadevara
About this chapter
Cite this chapter
Ayyadevara, V.K. (2018). Gradient Boosting Machine. In: Pro Machine Learning Algorithms . Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-3564-5_6
Download citation
DOI: https://doi.org/10.1007/978-1-4842-3564-5_6
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-3563-8
Online ISBN: 978-1-4842-3564-5
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)