Introduction to Boosted Trees
Introduction to Boosted Trees
Learn when to apply Boosted Trees and see how to use this technique with the BigML Dashboard and the API, as well as how to properly automate it with WhizzML.
Join the DZone community and get the full member experience.Join For Free
The open source HPCC Systems platform is a proven, easy to use solution for managing data at scale. Visit our Easy Guide to learn more about this completely free platform, test drive some code in the online Playground, and get started today.
BigML has brought Boosted trees to the dashboard and API as part of the newest release. This newest addition to our ensemble-based strategies is a supervised learning technique that can help you solve your classification and regression problems even more effectively.
To best inform you about it, we have prepared a series of blog posts that will help you get a good understanding. Today, we start with the basic concepts of Boosted Trees. Subsequent posts will gradually dive deeper to help you become a master of this new resource by presenting a use case that will help you discern when to apply Boosted Trees, demonstrating how to use this technique with the BigML Dashboard and the API, as well as how to properly automate it with WhizzML. Finally, we will conclude with a detailed technical view of how BigML Boosted Trees work under the hood.
Let’s begin our Boosted Trees journey!
Why Boosted Trees?
First of all, let’s recap the different strategies based on single decision trees and ensembles BigML offers to solve classification and regression problems and find out which technique is the most appropriate to achieve the best results depending on the characteristics of your dataset.
BigML models were the first technique that BigML implemented. They use a proprietary decision tree algorithm based on the Classification and Regression Trees (CART) algorithm proposed by Leo Breiman. Single Decision tTrees are composed of nodes and branches that create a model of decisions with a tree graph. The nodes represent the predictors or labels that have an influence in the predictive path, and the branches represent the rules followed by the algorithm to make a given prediction. Single decision trees are a good choice when you value the human interpretability of your model. Unlike many ML techniques, individual decision trees are easy for a human to inspect and understand.
Bagging (or Bootsrap Aggregating), the second prediction technique brought to the BigML Dashboard and API, uses a collection of trees (rather than a single one), each tree built with a different random subset of the original dataset for each model in the ensemble. Specifically, BigML defaults to a sampling rate of 100% (with replacement) for each model. This means some of the original instances will be repeated and others will be left out. Bagging performs well when a dataset has many noisy features and only one or two are relevant. In those cases, Bagging will be the best option.
Random Decision Forests extend the Bagging technique by only considering a random subset of the input fields at each split of the tree. By adding randomness in this process, Random Decision Forests help avoid overfitting. When there are many useful fields in your dataset, Random Decision Forests are a strong choice.
In Bagging or Random Decision Forests, the ensemble is a collection of models, each of which tries to predict the same field: the problem’s objective field. So, depending on whether we are solving a classification or a regression problem, our models will have a categorical or a numeric field as objective. Each model is built on a different sample of data (if Random Decision Forests also using a different sample of fields in each split), so their predictions will have some variation. Finally, the ensemble will issue a prediction using component model predictions as votes aggregating them through different strategies (plurality, confidence-weighted, or probability-weighted).
The boosting ensemble technique is significantly different. To begin with, the ensemble is a collection of models that do not predict the real objective field of the ensemble, but rather the improvements needed for the function that computes this objective. As shown in the image above, the modeling process starts by assigning some initial values to this function and creates a model to predict which gradient will improve the function results. The next iteration considers both the initial values and these corrections as its original state and looks for the next gradient to improve the prediction function results even further.
The process stops when the prediction function results match the real values or the number of iterations reaches a limit. As a consequence, all the models in the ensemble will always have a numeric objective field, the gradient for this function. The real objective field of the problem will then be computed by adding up the contributions of each model weighted by some coefficients. If the problem is a classification, each category (or class) in the objective field has its own subset of models in the ensemble whose goal is adjusting the function to predict this category.
For Bagging and Random Decision Forests, each tree is independent of one another — making them easy to construct in parallel. Since a boosted tree depends on the previous trees, a Boosted Tree ensemble is inherently sequential. Nonetheless, BigML parallelizes the construction of individual trees. That means even though boosting is a computation-heavy model, we can train Boosted Trees relatively quickly.
How Do Boosted Trees Work in BigML?
Let’s illustrate how Boosted Trees work with a dataset that predicts the unemployment rate in the U.S. Before creating the Boosted Tree ensemble, we split the dataset into two parts: one for training and one for testing. Then, we train a Boosted Tree ensemble with five iterations by using the training subset of our data. Thanks to the Partial Dependence Plot (PDP) visualization, we observe that the higher the “Civilian Employment Population Ratio,” the lower the unemployment rate, and vice versa.
But can we trust this prediction? To get an objective measure of how well our ensemble is predicting, we evaluate it in BigML as any other kind of supervised model. The performance of our first attempt is not as good as it could be. A simple way of trying to improve it is to increase the number of iterations the boosting algorithm performs in order to improve its tree. Remember that in our first attempt, we set that number to the very conservative value of 5. Let’s create another Boosted Tree, but this time with 400 iterations.
Voila! If we compare the evaluations of both models, as shown in the image below, we observe a very significant performance boost, both in the lower absolute and squared errors and in the higher R-squared value for our ensemble with 400 iterations.
Stay tuned for the upcoming posts to find out how to create Boosted Trees in BigML and how to interpret and evaluate them in order to make better predictions.
To wrap up this blog post, we can say that Boosted Trees...
...are a variation of tree ensembles where the tree outputs are additive rather than averaged (or majority voted).
...do not try to predict the objective field directly. Instead, they try to fit a gradient by correcting mistakes made in previous iterations.
...are very useful when you have a lot of data and you expect the decision function to be very complex. The effect of additional trees is basically an expansion of the hypothesis space beyond other ensemble strategies like Bagging or Random Decision Forests.
...help solve both classification and regression problems, such as the following: churn analysis, risk analysis, loan analysis, fraud analysis, sentiment analysis, predictive maintenance, content prioritization, next best offer, lifetime value, predictive advertising, price modeling, sales estimation, patient diagnoses, or targeted recruitment, among others.
Published at DZone with permission of Maria Jesus Alonso , DZone MVB. See the original article here.
Opinions expressed by DZone contributors are their own.