Boosting is a class of ensemble machine learning algorithms that involve combining the predictions from many weak learners.<\/p>\n
A weak learner is a model that is very simple, although has some skill on the dataset. Boosting was a theoretical concept long before a practical algorithm could be developed, and the AdaBoost (adaptive boosting) algorithm was the first successful approach for the idea.<\/p>\n
The AdaBoost algorithm involves using very short (one-level) decision trees as weak learners that are added sequentially to the ensemble. Each subsequent model attempts to correct the predictions made by the model before it in the sequence. This is achieved by weighing the training dataset to put more focus on training examples on which prior models made prediction errors.<\/p>\n
In this tutorial, you will discover how to develop AdaBoost ensembles for classification and regression.<\/p>\n
After completing this tutorial, you will know:<\/p>\n
- \n
- AdaBoost ensemble is an ensemble created from decision trees added sequentially to the model<\/li>\n
- How to use the AdaBoost ensemble for classification and regression with scikit-learn.<\/li>\n
- How to explore the effect of AdaBoost model hyperparameters on model performance.<\/li>\n<\/ul>\n
Let’s get started.<\/p>\n
![\"How](\"https:\/\/machinelearningmastery.com\/wp-content\/uploads\/2020\/05\/How-to-Develop-an-AdaBoost-Ensemble-in-Python.jpg\")
<\/p>\nHow to Develop an AdaBoost Ensemble in Python
Photo by Ray in Manila<\/a>, some rights reserved.<\/p>\n<\/div>\nTutorial Overview<\/h2>\n
This tutorial is divided into three parts; they are:<\/p>\n
- \n
- AdaBoost Ensemble Algorithm<\/li>\n
- AdaBoost Scikit-Learn API\n
- \n
- AdaBoost for Classification<\/li>\n
- AdaBoost for Regression<\/li>\n<\/ol>\n<\/li>\n
- AdaBoost Hyperparameters\n
- \n
- Explore Number of Trees<\/li>\n
- Explore Weak Learner<\/li>\n
- Explore Learning Rate<\/li>\n
- Explore Alternate Algorithm<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n
AdaBoost Ensemble Algorithm<\/h2>\n
Boosting<\/a> refers to a class of machine learning ensemble algorithms where models are added sequentially and later models in the sequence correct the predictions made by earlier models in the sequence.<\/p>\n
AdaBoost<\/a>, short for “Adaptive Boosting<\/em>,” is a boosting ensemble machine learning algorithm, and was one of the first successful boosting approaches.<\/p>\n
\n
We call the algorithm AdaBoost because, unlike previous algorithms, it adjusts adaptively to the errors of the weak hypotheses<\/p>\n<\/blockquote>\n
— A Decision-Theoretic Generalization of on-Line Learning and an Application to Boosting<\/a>, 1996.<\/p>\n
AdaBoost combines the predictions from short one-level decision trees, called decision stumps, although other algorithms can also be used. Decision stump algorithms are used as the AdaBoost algorithm seeks to use many weak models and correct their predictions by adding additional weak models.<\/p>\n
The training algorithm involves starting with one decision tree, finding those examples in the training dataset that were misclassified, and adding more weight to those examples. Another tree is trained on the same data, although now weighted by the misclassification errors. This process is repeated until a desired number of trees are added.<\/p>\n
\n
If a training data point is misclassified, the weight of that training data point is increased (boosted). A second classifier is built using the new weights, which are no longer equal. Again, misclassified training data have their weights boosted and the procedure is repeated.<\/p>\n<\/blockquote>\n
— Multi-class AdaBoost<\/a>, 2009.<\/p>\n
The algorithm was developed for classification and involves combining the predictions made by all decision trees in the ensemble. A similar approach was also developed for regression problems where predictions are made by using the average of the decision trees. The contribution of each model to the ensemble prediction is weighted based on the performance of the model on the training dataset.<\/p>\n
\n
… the new algorithm needs no prior knowledge of the accuracies of the weak hypotheses. Rather, it adapts to these accuracies and generates a weighted majority hypothesis in which the weight of each weak hypothesis is a function of its accuracy.<\/p>\n<\/blockquote>\n
— A Decision-Theoretic Generalization of on-Line Learning and an Application to Boosting<\/a>, 1996.<\/p>\n
Now that we are familiar with the AdaBoost algorithm, let’s look at how we can fit AdaBoost models in Python.<\/p>\n
AdaBoost Scikit-Learn API<\/h2>\n
AdaBoost ensembles can be implemented from scratch, although this can be challenging for beginners.<\/p>\n
For an example, see the tutorial:<\/p>\n
- \n
- Boosting and AdaBoost for Machine Learning<\/a><\/li>\n<\/ul>\n
The scikit-learn Python machine learning library provides an implementation of AdaBoost ensembles for machine learning.<\/p>\n
It is available in a modern version of the library.<\/p>\n
First, confirm that you are using a modern version of the library by running the following script:<\/p>\n
# check scikit-learn version\r\nimport sklearn\r\nprint(sklearn.__version__)<\/pre>\n
Running the script will print your version of scikit-learn.<\/p>\n
Your version should be the same or higher. If not, you must upgrade your version of the scikit-learn library.<\/p>\n
0.22.1<\/pre>\n
AdaBoost is provided via the AdaBoostRegressor<\/a> and AdaBoostClassifier<\/a> classes.<\/p>\n
Both models operate the same way and take the same arguments that influence how the decision trees are created.<\/p>\n
Randomness is used in the construction of the model. This means that each time the algorithm is run on the same data, it will produce a slightly different model.<\/p>\n
When using machine learning algorithms that have a stochastic learning algorithm, it is good practice to evaluate them by averaging their performance across multiple runs or repeats of cross-validation. When fitting a final model it may be desirable to either increase the number of trees until the variance of the model is reduced across repeated evaluations, or to fit multiple final models and average their predictions.<\/p>\n
Let’s take a look at how to develop an AdaBoost ensemble for both classification and regression.<\/p>\n
AdaBoost for Classification<\/h3>\n
In this section, we will look at using AdaBoost for a classification problem.<\/p>\n
First, we can use the make_classification() function<\/a> to create a synthetic binary classification problem with 1,000 examples and 20 input features.<\/p>\n
The complete example is listed below.<\/p>\n
# test classification dataset\r\nfrom sklearn.datasets import make_classification\r\n# define dataset\r\nX, y = make_classification(n_samples=1000, n_features=20, n_informative=15, n_redundant=5, random_state=6)\r\n# summarize the dataset\r\nprint(X.shape, y.shape)<\/pre>\n
Running the example creates the dataset and summarizes the shape of the input and output components.<\/p>\n
(1000, 20) (1000,)<\/pre>\n
Next, we can evaluate an AdaBoost algorithm on this dataset.<\/p>\n
We will evaluate the model using repeated stratified k-fold cross-validation<\/a>, with three repeats and 10 folds. We will report the mean and standard deviation of the accuracy of the model across all repeats and folds.<\/p>\n
# evaluate adaboost algorithm for classification\r\nfrom numpy import mean\r\nfrom numpy import std\r\nfrom sklearn.datasets import make_classification\r\nfrom sklearn.model_selection import cross_val_score\r\nfrom sklearn.model_selection import RepeatedStratifiedKFold\r\nfrom sklearn.ensemble import AdaBoostClassifier\r\n# define dataset\r\nX, y = make_classification(n_samples=1000, n_features=20, n_informative=15, n_redundant=5, random_state=6)\r\n# define the model\r\nmodel = AdaBoostClassifier()\r\n# evaluate the model\r\ncv = RepeatedStratifiedKFold(n_splits=10, n_repeats=3, random_state=1)\r\nn_scores = cross_val_score(model, X, y, scoring='accuracy', cv=cv, n_jobs=-1, error_score='raise')\r\n# report performance\r\nprint('Accuracy: %.3f (%.3f)' % (mean(n_scores), std(n_scores)))<\/pre>\nRunning the example reports the mean and standard deviation accuracy of the model.<\/p>\n
Your specific results may vary given the stochastic nature of the learning algorithm. Try running the example a few times.<\/p>\n
In this case, we can see the AdaBoost ensemble with default hyperparameters achieves a classification accuracy of about 80 percent on this test dataset.<\/p>\n
Accuracy: 0.806 (0.041)<\/pre>\n
We can also use the AdaBoost model as a final model and make predictions for classification.<\/p>\n
First, the AdaBoost ensemble is fit on all available data, then the predict()<\/em> function can be called to make predictions on new data.<\/p>\n
The example below demonstrates this on our binary classification dataset.<\/p>\n
# make predictions using adaboost for classification\r\nfrom sklearn.datasets import make_classification\r\nfrom sklearn.ensemble import AdaBoostClassifier\r\n# define dataset\r\nX, y = make_classification(n_samples=1000, n_features=20, n_informative=15, n_redundant=5, random_state=6)\r\n# define the model\r\nmodel = AdaBoostClassifier()\r\n# fit the model on the whole dataset\r\nmodel.fit(X, y)\r\n# make a single prediction\r\nrow = [[-3.47224758,1.95378146,0.04875169,-0.91592588,-3.54022468,1.96405547,-7.72564954,-2.64787168,-1.81726906,-1.67104974,2.33762043,-4.30273117,0.4839841,-1.28253034,-10.6704077,-0.7641103,-3.58493721,2.07283886,0.08385173,0.91461126]]\r\nyhat = model.predict(row)\r\nprint('Predicted Class: %d' % yhat[0])<\/pre>\nRunning the example fits the AdaBoost ensemble model on the entire dataset and is then used to make a prediction on a new row of data, as we might when using the model in an application.<\/p>\n
Predicted Class: 0<\/pre>\n
Now that we are familiar with using AdaBoost for classification, let’s look at the API for regression.<\/p>\n
AdaBoost for Regression<\/h3>\n
In this section, we will look at using AdaBoost for a regression problem.<\/p>\n
First, we can use the make_regression() function<\/a> to create a synthetic regression problem with 1,000 examples and 20 input features.<\/p>\n
The complete example is listed below.<\/p>\n
# test regression dataset\r\nfrom sklearn.datasets import make_regression\r\n# define dataset\r\nX, y = make_regression(n_samples=1000, n_features=20, n_informative=15, noise=0.1, random_state=6)\r\n# summarize the dataset\r\nprint(X.shape, y.shape)<\/pre>\n
Running the example creates the dataset and summarizes the shape of the input and output components.<\/p>\n
(1000, 20) (1000,)<\/pre>\n
Next, we can evaluate an AdaBoost algorithm on this dataset.<\/p>\n
As we did with the last section, we will evaluate the model using repeated k-fold cross-validation, with three repeats and 10 folds. We will report the mean absolute error (MAE) of the model across all repeats and folds. The scikit-learn library makes the MAE negative so that it is maximized instead of minimized. This means that larger negative MAE are better and a perfect model has a MAE of 0.<\/p>\n
The complete example is listed below.<\/p>\n
# evaluate adaboost ensemble for regression\r\nfrom numpy import mean\r\nfrom numpy import std\r\nfrom sklearn.datasets import make_regression\r\nfrom sklearn.model_selection import cross_val_score\r\nfrom sklearn.model_selection import RepeatedKFold\r\nfrom sklearn.ensemble import AdaBoostRegressor\r\n# define dataset\r\nX, y = make_regression(n_samples=1000, n_features=20, n_informative=15, noise=0.1, random_state=6)\r\n# define the model\r\nmodel = AdaBoostRegressor()\r\n# evaluate the model\r\ncv = RepeatedKFold(n_splits=10, n_repeats=3, random_state=1)\r\nn_scores = cross_val_score(model, X, y, scoring='neg_mean_absolute_error', cv=cv, n_jobs=-1, error_score='raise')\r\n# report performance\r\nprint('MAE: %.3f (%.3f)' % (mean(n_scores), std(n_scores)))<\/pre>\nRunning the example reports the mean and standard deviation accuracy of the model.<\/p>\n
Your specific results may vary given the stochastic nature of the learning algorithm. Try running the example a few times.<\/p>\n
In this case, we can see the AdaBoost ensemble with default hyperparameters achieves a MAE of about 100.<\/p>\n
MAE: -72.327 (4.041)<\/pre>\n
We can also use the AdaBoost model as a final model and make predictions for regression.<\/p>\n
First, the AdaBoost ensemble is fit on all available data, then the predict()<\/em> function can be called to make predictions on new data.<\/p>\n
The example below demonstrates this on our regression dataset.<\/p>\n
# adaboost ensemble for making predictions for regression\r\nfrom sklearn.datasets import make_regression\r\nfrom sklearn.ensemble import AdaBoostRegressor\r\n# define dataset\r\nX, y = make_regression(n_samples=1000, n_features=20, n_informative=15, noise=0.1, random_state=6)\r\n# define the model\r\nmodel = AdaBoostRegressor()\r\n# fit the model on the whole dataset\r\nmodel.fit(X, y)\r\n# make a single prediction\r\nrow = [[1.20871625,0.88440466,-0.9030013,-0.22687731,-0.82940077,-1.14410988,1.26554256,-0.2842871,1.43929072,0.74250241,0.34035501,0.45363034,0.1778756,-1.75252881,-1.33337384,-1.50337215,-0.45099008,0.46160133,0.58385557,-1.79936198]]\r\nyhat = model.predict(row)\r\nprint('Prediction: %d' % yhat[0])<\/pre>\nRunning the example fits the AdaBoost ensemble model on the entire dataset and is then used to make a prediction on a new row of data, as we might when using the model in an application.<\/p>\n
Prediction: -10<\/pre>\n
Now that we are familiar with using the scikit-learn API to evaluate and use AdaBoost ensembles, let’s look at configuring the model.<\/p>\n
AdaBoost Hyperparameters<\/h2>\n
In this section, we will take a closer look at some of the hyperparameters you should consider tuning for the AdaBoost ensemble and their effect on model performance.<\/p>\n
Explore Number of Trees<\/h3>\n
An important hyperparameter for AdaBoost algorithm is the number of decision trees used in the ensemble.<\/p>\n
Recall that each decision tree used in the ensemble is designed to be a weak learner. That is, it has skill over random prediction, but is not highly skillful. As such, one-level decision trees are used, called decision stumps.<\/p>\n
The number of trees added to the model must be high for the model to work well, often hundreds, if not thousands.<\/p>\n
The number of trees can be set via the “n_estimators<\/em>” argument and defaults to 50.<\/p>\n
The example below explores the effect of the number of trees with values between 10 to 5,000.<\/p>\n
# explore adaboost ensemble number of trees effect on performance\r\nfrom numpy import mean\r\nfrom numpy import std\r\nfrom sklearn.datasets import make_classification\r\nfrom sklearn.model_selection import cross_val_score\r\nfrom sklearn.model_selection import RepeatedStratifiedKFold\r\nfrom sklearn.ensemble import AdaBoostClassifier\r\nfrom matplotlib import pyplot\r\n\r\n# get the dataset\r\ndef get_dataset():\r\n\tX, y = make_classification(n_samples=1000, n_features=20, n_informative=15, n_redundant=5, random_state=6)\r\n\treturn X, y\r\n\r\n# get a list of models to evaluate\r\ndef get_models():\r\n\tmodels = dict()\r\n\tmodels['10'] = AdaBoostClassifier(n_estimators=10)\r\n\tmodels['50'] = AdaBoostClassifier(n_estimators=50)\r\n\tmodels['100'] = AdaBoostClassifier(n_estimators=100)\r\n\tmodels['500'] = AdaBoostClassifier(n_estimators=500)\r\n\tmodels['1000'] = AdaBoostClassifier(n_estimators=1000)\r\n\tmodels['5000'] = AdaBoostClassifier(n_estimators=5000)\r\n\treturn models\r\n\r\n# evaluate a give model using cross-validation\r\ndef evaluate_model(model):\r\n\tcv = RepeatedStratifiedKFold(n_splits=10, n_repeats=3, random_state=1)\r\n\tscores = cross_val_score(model, X, y, scoring='accuracy', cv=cv, n_jobs=-1, error_score='raise')\r\n\treturn scores\r\n\r\n# define dataset\r\nX, y = get_dataset()\r\n# get the models to evaluate\r\nmodels = get_models()\r\n# evaluate the models and store results\r\nresults, names = list(), list()\r\nfor name, model in models.items():\r\n\tscores = evaluate_model(model)\r\n\tresults.append(scores)\r\n\tnames.append(name)\r\n\tprint('>%s %.3f (%.3f)' % (name, mean(scores), std(scores)))\r\n# plot model performance for comparison\r\npyplot.boxplot(results, labels=names, showmeans=True)\r\npyplot.show()<\/pre>\nRunning the example first reports the mean accuracy for each configured number of decision trees.<\/p>\n
In this case, we can see that that performance improves on this dataset until about 50 trees and declines after that. This might be a sign of the ensemble overfitting the training dataset after additional trees are added.<\/p>\n
>10 0.773 (0.039)\r\n>50 0.806 (0.041)\r\n>100 0.801 (0.032)\r\n>500 0.793 (0.028)\r\n>1000 0.791 (0.032)\r\n>5000 0.782 (0.031)<\/pre>\n
A box and whisker plot is created for the distribution of accuracy scores for each configured number of trees.<\/p>\n
We can see the general trend of model performance and ensemble size.<\/p>\n
![\"Box](\"https:\/\/machinelearningmastery.com\/wp-content\/uploads\/2020\/02\/Box-Plot-of-AdaBoost-Ensemble-Size-vs-Classification-Accuracy.png\")
<\/p>\nBox Plot of AdaBoost Ensemble Size vs. Classification Accuracy<\/p>\n<\/div>\n
Explore Weak Learner<\/h3>\n
A decision tree with one level is used as the weak learner by default.<\/p>\n
We can make the models used in the ensemble less weak (more skillful) by increasing the depth of the decision tree.<\/p>\n
The example below explores the effect of increasing the depth of the DecisionTreeClassifier<\/a> weak learner on the AdBoost ensemble.<\/p>\n
# explore adaboost ensemble tree depth effect on performance\r\nfrom numpy import mean\r\nfrom numpy import std\r\nfrom sklearn.datasets import make_classification\r\nfrom sklearn.model_selection import cross_val_score\r\nfrom sklearn.model_selection import RepeatedStratifiedKFold\r\nfrom sklearn.ensemble import AdaBoostClassifier\r\nfrom sklearn.tree import DecisionTreeClassifier\r\nfrom matplotlib import pyplot\r\n\r\n# get the dataset\r\ndef get_dataset():\r\n\tX, y = make_classification(n_samples=1000, n_features=20, n_informative=15, n_redundant=5, random_state=6)\r\n\treturn X, y\r\n\r\n# get a list of models to evaluate\r\ndef get_models():\r\n\tmodels = dict()\r\n\tfor i in range(1,11):\r\n\t\tmodels[str(i)] = AdaBoostClassifier(base_estimator=DecisionTreeClassifier(max_depth=i))\r\n\treturn models\r\n\r\n# evaluate a give model using cross-validation\r\ndef evaluate_model(model):\r\n\tcv = RepeatedStratifiedKFold(n_splits=10, n_repeats=3, random_state=1)\r\n\tscores = cross_val_score(model, X, y, scoring='accuracy', cv=cv, n_jobs=-1, error_score='raise')\r\n\treturn scores\r\n\r\n# define dataset\r\nX, y = get_dataset()\r\n# get the models to evaluate\r\nmodels = get_models()\r\n# evaluate the models and store results\r\nresults, names = list(), list()\r\nfor name, model in models.items():\r\n\tscores = evaluate_model(model)\r\n\tresults.append(scores)\r\n\tnames.append(name)\r\n\tprint('>%s %.3f (%.3f)' % (name, mean(scores), std(scores)))\r\n# plot model performance for comparison\r\npyplot.boxplot(results, labels=names, showmeans=True)\r\npyplot.show()<\/pre>\nRunning the example first reports the mean accuracy for each configured weak learner tree depth.<\/p>\n
In this case, we can see that as the depth of the decision trees is increased, the performance of the ensemble is also increased on this dataset.<\/p>\n
>1 0.806 (0.041)\r\n>2 0.864 (0.028)\r\n>3 0.867 (0.030)\r\n>4 0.889 (0.029)\r\n>5 0.909 (0.021)\r\n>6 0.923 (0.020)\r\n>7 0.927 (0.025)\r\n>8 0.928 (0.028)\r\n>9 0.923 (0.017)\r\n>10 0.926 (0.030)<\/pre>\n
A box and whisker plot is created for the distribution of accuracy scores for each configured weak learner depth.<\/p>\n
We can see the general trend of model performance and weak learner depth.<\/p>\n
![\"Box](\"https:\/\/machinelearningmastery.com\/wp-content\/uploads\/2020\/02\/Box-Plot-of-AdaBoost-Ensemble-Weak-Learner-Depth-vs-Classification-Accuracy.png\")
<\/p>\nBox Plot of AdaBoost Ensemble Weak Learner Depth vs. Classification Accuracy<\/p>\n<\/div>\n
Explore Learning Rate<\/h3>\n
AdaBoost also supports a learning rate that controls the contribution of each model to the ensemble prediction.<\/p>\n
This is controlled by the “learning_rate<\/em>” argument and by default is set to 1.0 or full contribution. Smaller or larger values might be appropriate depending on the number of models used in the ensemble. There is a balance between the contribution of the models and the number of trees in the ensemble.<\/p>\n
More trees may require a smaller learning rate; fewer trees may require a larger learning rate.<\/p>\n
The example below explores learning rate values between 0.1 and 2.0 in 0.1 increments.<\/p>\n
# explore adaboost ensemble learning rate effect on performance\r\nfrom numpy import mean\r\nfrom numpy import std\r\nfrom numpy import arange\r\nfrom sklearn.datasets import make_classification\r\nfrom sklearn.model_selection import cross_val_score\r\nfrom sklearn.model_selection import RepeatedStratifiedKFold\r\nfrom sklearn.ensemble import AdaBoostClassifier\r\nfrom matplotlib import pyplot\r\n\r\n# get the dataset\r\ndef get_dataset():\r\n\tX, y = make_classification(n_samples=1000, n_features=20, n_informative=15, n_redundant=5, random_state=6)\r\n\treturn X, y\r\n\r\n# get a list of models to evaluate\r\ndef get_models():\r\n\tmodels = dict()\r\n\tfor i in arange(0.1, 2.1, 0.1):\r\n\t\tkey = '%.3f' % i\r\n\t\tmodels[key] = AdaBoostClassifier(learning_rate=i)\r\n\treturn models\r\n\r\n# evaluate a give model using cross-validation\r\ndef evaluate_model(model):\r\n\tcv = RepeatedStratifiedKFold(n_splits=10, n_repeats=3, random_state=1)\r\n\tscores = cross_val_score(model, X, y, scoring='accuracy', cv=cv, n_jobs=-1, error_score='raise')\r\n\treturn scores\r\n\r\n# define dataset\r\nX, y = get_dataset()\r\n# get the models to evaluate\r\nmodels = get_models()\r\n# evaluate the models and store results\r\nresults, names = list(), list()\r\nfor name, model in models.items():\r\n\tscores = evaluate_model(model)\r\n\tresults.append(scores)\r\n\tnames.append(name)\r\n\tprint('>%s %.3f (%.3f)' % (name, mean(scores), std(scores)))\r\n# plot model performance for comparison\r\npyplot.boxplot(results, labels=names, showmeans=True)\r\npyplot.xticks(rotation=45)\r\npyplot.show()<\/pre>\nRunning the example first reports the mean accuracy for each configured learning rate.<\/p>\n
In this case, we can see similar values between 0.5 to 1.0 and a decrease in model performance after that.<\/p>\n
>0.100 0.767 (0.049)\r\n>0.200 0.786 (0.042)\r\n>0.300 0.802 (0.040)\r\n>0.400 0.798 (0.037)\r\n>0.500 0.805 (0.042)\r\n>0.600 0.795 (0.031)\r\n>0.700 0.799 (0.035)\r\n>0.800 0.801 (0.033)\r\n>0.900 0.805 (0.032)\r\n>1.000 0.806 (0.041)\r\n>1.100 0.801 (0.037)\r\n>1.200 0.800 (0.030)\r\n>1.300 0.799 (0.041)\r\n>1.400 0.793 (0.041)\r\n>1.500 0.790 (0.040)\r\n>1.600 0.775 (0.034)\r\n>1.700 0.767 (0.054)\r\n>1.800 0.768 (0.040)\r\n>1.900 0.736 (0.047)\r\n>2.000 0.682 (0.048)<\/pre>\n
A box and whisker plot is created for the distribution of accuracy scores for each configured learning rate.<\/p>\n
We can see the general trend of decreasing model performance with a learning rate larger than 1.0 on this dataset.<\/p>\n
![\"Box](\"https:\/\/machinelearningmastery.com\/wp-content\/uploads\/2020\/02\/Box-Plot-of-AdaBoost-Ensemble-Learning-Rate-vs-Classification-Accuracy.png\")
<\/p>\nBox Plot of AdaBoost Ensemble Learning Rate vs. Classification Accuracy<\/p>\n<\/div>\n
Explore Alternate Algorithm<\/h3>\n
The default algorithm used in the ensemble is a decision tree, although other algorithms can be used.<\/p>\n
The intent is to use very simple models, called weak learners. Also, the scikit-learn implementation requires that any models used must also support weighted samples, as they are how the ensemble is created by fitting models based on a weighted version of the training dataset.<\/p>\n
The base model can be specified via the “base_estimator<\/em>” argument. The base model must also support predicting probabilities or probability-like scores in the case of classification. If the specified model does not support a weighted training dataset, you will see an error message as follows:<\/p>\n
ValueError: KNeighborsClassifier doesn't support sample_weight.<\/pre>\n
One example of a model that supports a weighted training is the logistic regression algorithm.<\/p>\n
The example below demonstrates an AdaBoost algorithm with a LogisticRegression<\/a> weak learner.<\/p>\n
# evaluate adaboost algorithm with logistic regression weak learner for classification\r\nfrom numpy import mean\r\nfrom numpy import std\r\nfrom sklearn.datasets import make_classification\r\nfrom sklearn.model_selection import cross_val_score\r\nfrom sklearn.model_selection import RepeatedStratifiedKFold\r\nfrom sklearn.ensemble import AdaBoostClassifier\r\nfrom sklearn.linear_model import LogisticRegression\r\n# define dataset\r\nX, y = make_classification(n_samples=1000, n_features=20, n_informative=15, n_redundant=5, random_state=6)\r\n# define the model\r\nmodel = AdaBoostClassifier(base_estimator=LogisticRegression())\r\n# evaluate the model\r\ncv = RepeatedStratifiedKFold(n_splits=10, n_repeats=3, random_state=1)\r\nn_scores = cross_val_score(model, X, y, scoring='accuracy', cv=cv, n_jobs=-1, error_score='raise')\r\n# report performance\r\nprint('Accuracy: %.3f (%.3f)' % (mean(n_scores), std(n_scores)))<\/pre>\nRunning the example reports the mean and standard deviation accuracy of the model.<\/p>\n
Your specific results may vary given the stochastic nature of the learning algorithm. Try running the example a few times.<\/p>\n
In this case, we can see the AdaBoost ensemble with a logistic regression weak model achieves a classification accuracy of about 79 percent on this test dataset.<\/p>\n
Accuracy: 0.794 (0.032)<\/pre>\n<\/p>\n
Further Reading<\/h2>\n
This section provides more resources on the topic if you are looking to go deeper.<\/p>\n
Tutorials<\/h3>\n
- \n
- Boosting and AdaBoost for Machine Learning<\/a><\/li>\n<\/ul>\n
Papers<\/h3>\n
- \n
- A Decision-Theoretic Generalization of on-Line Learning and an Application to Boosting<\/a>, 1996.<\/li>\n
- Multi-class AdaBoost<\/a>, 2009.<\/li>\n
- Improving Regressors using Boosting Techniques<\/a>, 1997.<\/li>\n<\/ul>\n
APIs<\/h3>\n
- \n
- sklearn.ensemble.AdaBoostRegressor API<\/a>.<\/li>\n
- sklearn.ensemble.AdaBoostClassifier API<\/a>.<\/li>\n<\/ul>\n
Articles<\/h3>\n
- \n
- Boosting (machine learning), Wikipedia<\/a>.<\/li>\n
- AdaBoost, Wikipedia<\/a>.<\/li>\n<\/ul>\n
Summary<\/h2>\n
In this tutorial, you discovered how to develop AdaBoost ensembles for classification and regression.<\/p>\n
Specifically, you learned:<\/p>\n
- \n
- AdaBoost ensemble is an ensemble created from decision trees added sequentially to the model.<\/li>\n
- How to use the AdaBoost ensemble for classification and regression with scikit-learn.<\/li>\n
- How to explore the effect of AdaBoost model hyperparameters on model performance.<\/li>\n<\/ul>\n
Do you have any questions?<\/strong>
\nAsk your questions in the comments below and I will do my best to answer.<\/p>\nThe post How to Develop an AdaBoost Ensemble in Python<\/a> appeared first on Machine Learning Mastery<\/a>.<\/p>\n<\/div>\n
Go to Source<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"
- AdaBoost, Wikipedia<\/a>.<\/li>\n<\/ul>\n
- sklearn.ensemble.AdaBoostClassifier API<\/a>.<\/li>\n<\/ul>\n
- Multi-class AdaBoost<\/a>, 2009.<\/li>\n
- A Decision-Theoretic Generalization of on-Line Learning and an Application to Boosting<\/a>, 1996.<\/li>\n
- Boosting and AdaBoost for Machine Learning<\/a><\/li>\n<\/ul>\n
- Boosting and AdaBoost for Machine Learning<\/a><\/li>\n<\/ul>\n