April 2019
Intermediate to advanced
426 pages
11h 13m
English
Gradient tree boosting, or simply gradient boosting, is a technique of improving or boosting the performance of weak learners using a gradient descent procedure to minimize the loss function. Tree models, usually decision trees, are added one at a time and build the model in a stage-wise fashion, while leaving the existing trees in the model unchanged. Since gradient boosting is a greedy algorithm, it can overfit a training dataset quickly. However, it can benefit from regularization methods that penalize various parts of the algorithm and reduce overfitting to improve its performance.
The sklearn.ensemble module provides a gradient-boosting regressor called GradientBoostingRegressor.
Read now
Unlock full access