Gradient-boosted trees
- This algorithm can also be used for regression and classification.
- It builds trees one after another, each new tree fixing the problems of the previous one.
- It involves no randomization by default.
- It uses shallow trees (maximum depth about 5). Therefore requires less memory that random forests.