boosting is a popular ensemble learning technique that combines several weak learners to create a strong learner. it works by iteratively training weak learners on subsets of the data and assigning higher weights to the misclassified samples to increase their importance in the subsequent iterations. this process is repeated until the desired level of performance is achieved.

here are some techniques to boost model performance in machine learning −

feature engineering − feature engineering involves creating new features from the existing features or transforming the existing features to make them more informative for the model. this can include techniques such as one-hot encoding, scaling, normalization, and feature selection.
hyperparameter tuning − hyperparameters are parameters that are not learned during training but are set by the data scientist. they control the behavior of the model, and tuning them can significantly impact model performance. grid search and randomized search are common techniques for hyperparameter tuning.
ensemble learning − ensemble learning involves combining multiple models to improve performance. techniques such as bagging, boosting, and stacking can be used to create ensembles. random forests are an example of a bagging ensemble, while gradient boosting machines (gbms) are an example of a boosting ensemble.
regularization − regularization is a technique that prevents overfitting by adding a penalty term to the loss function. l1 regularization (lasso) and l2 regularization (ridge) are common techniques used in linear models, while dropout is a technique used in neural networks.
data augmentation − data augmentation involves generating new data from the existing data by applying transformations such as rotation, scaling, and flipping. this can help to reduce overfitting and improve model performance.
model architecture − the architecture of the model can significantly impact its performance. techniques such as deep learning and convolutional neural networks (cnns) can be used to create more complex models that are better able to learn complex patterns in the data.
early stopping − early stopping is a technique used to prevent overfitting by stopping the training process once the model performance stops improving on a validation set. this prevents the model from continuing to learn the noise in the data and can help to improve generalization.
cross-validation − cross-validation is a technique used to evaluate the performance of a model on multiple subsets of the data. this can help to identify overfitting and can be used to select the best hyperparameters for the model.

these techniques can be implemented in python using various machine learning libraries such as scikit-learn, tensorflow, and keras. by using these techniques, data scientists can improve the performance of their models and create more accurate predictions.

the following example below in which implement cross-validation using scikit-learn −

example

from sklearn.datasets import load_iris
from sklearn.model_selection import cross_val_score
from sklearn.ensemble import gradientboostingclassifier

# load the iris dataset
iris = load_iris()
x = iris.data
y = iris.target

# create a gradient boosting classifier
gb_clf = gradientboostingclassifier()

# perform 5-fold cross-validation on the classifier
scores = cross_val_score(gb_clf, x, y, cv=5)

# print the average accuracy and standard deviation of the cross-validation scores
print("accuracy: %0.2f (+/- %0.2f)" % (scores.mean(), scores.std() * 2))

output

when you execute this code, it will produce the following output −

accuracy: 0.96 (+/- 0.07)

performance improvement with ensembles

ensembles can give us boost in the machine learning result by combining several models. basically, ensemble models consist of several individually trained supervised learning models and their results are merged in various ways to achieve better predictive performance compared to a single model. ensemble methods can be divided into following two groups −

sequential ensemble methods

as the name implies, in these kind of ensemble methods, the base learners are generated sequentially. the motivation of such methods is to exploit the dependency among base learners.

parallel ensemble methods

as the name implies, in these kind of ensemble methods, the base learners are generated in parallel. the motivation of such methods is to exploit the independence among base learners.

ensemble learning methods

the following are the most popular ensemble learning methods i.e. the methods for combining the predictions from different models −

bagging

the term bagging is also known as bootstrap aggregation. in bagging methods, ensemble model tries to improve prediction accuracy and decrease model variance by combining predictions of individual models trained over randomly generated training samples. the final prediction of ensemble model will be given by calculating the average of all predictions from the individual estimators. one of the best examples of bagging methods are random forests.

boosting

in boosting method, the main principle of building ensemble model is to build it incrementally by training each base model estimator sequentially. as the name suggests, it basically combine several week base learners, trained sequentially over multiple iterations of training data, to build powerful ensemble. during the training of week base learners, higher weights are assigned to those learners which were misclassified earlier. the example of boosting method is adaboost.

voting

in this ensemble learning model, multiple models of different types are built and some simple statistics, like calculating mean or median etc., are used to combine the predictions. this prediction will serve as the additional input for training to make the final prediction.

bagging ensemble algorithms

the following are three bagging ensemble algorithms −

bagged decision tree

as we know that bagging ensemble methods work well with the algorithms that have high variance and, in this concern, the best one is decision tree algorithm. in the following python recipe, we are going to build bagged decision tree ensemble model by using baggingclassifier function of sklearn with decisiontreeclasifier (a classification & regression trees algorithm) on pima indians diabetes dataset.

first, import the required packages as follows −

from pandas import read_csv
from sklearn.model_selection import kfold
from sklearn.model_selection import cross_val_score
from sklearn.ensemble import baggingclassifier
from sklearn.tree import decisiontreeclassifier

now, we need to load the pima diabetes dataset as we did in the previous examples −

path = r"c:\pima-indians-diabetes.csv"
headernames = ['preg', 'plas', 'pres', 'skin', 'test', 'mass', 'pedi', 'age', 'class']
data = read_csv(path, names=headernames)
array = data.values
x = array[:,0:8]
y = array[:,8]

next, give the input for 10-fold cross validation as follows −

seed = 7
kfold = kfold(n_splits=10, random_state=seed)
cart = decisiontreeclassifier()

we need to provide the number of trees we are going to build. here we are building 150 trees −

num_trees = 150

next, build the model with the help of following script −

model = baggingclassifier(base_estimator=cart, n_estimators=num_trees, random_state=seed)

calculate and print the result as follows −

results = cross_val_score(model, x, y, cv=kfold)
print(results.mean())

output

0.7733766233766234

the output above shows that we got around 77% accuracy of our bagged decision tree classifier model.

random forest

it is an extension of bagged decision trees. for individual classifiers, the samples of training dataset are taken with replacement, but the trees are constructed in such a way that reduces the correlation between them. also, a random subset of features is considered to choose each split point rather than greedily choosing the best split point in construction of each tree.

in the following python recipe, we are going to build bagged random forest ensemble model by using randomforestclassifier class of sklearn on pima indians diabetes dataset.

first, import the required packages as follows −

from pandas import read_csv
from sklearn.model_selection import kfold
from sklearn.model_selection import cross_val_score
from sklearn.ensemble import randomforestclassifier

now, we need to load the pima diabetes dataset as did in previous examples −

path = r"c:\pima-indians-diabetes.csv"
headernames = ['preg', 'plas', 'pres', 'skin', 'test', 'mass', 'pedi', 'age', 'class']
data = read_csv(path, names=headernames)
array = data.values
x = array[:,0:8]
y = array[:,8]

next, give the input for 10-fold cross validation as follows −

seed = 7
kfold = kfold(n_splits=10, random_state=seed)

we need to provide the number of trees we are going to build. here we are building 150 trees with split points chosen from 5 features −

num_trees = 150
max_features = 5

next, build the model with the help of following script −

model = randomforestclassifier(n_estimators=num_trees, max_features=max_features)

calculate and print the result as follows −

results = cross_val_score(model, x, y, cv=kfold)
print(results.mean())

output

0.7629357484620642

the output above shows that we got around 76% accuracy of our bagged random forest classifier model.

extra trees

it is another extension of bagged decision tree ensemble method. in this method, the random trees are constructed from the samples of the training dataset.

in the following python recipe, we are going to build extra tree ensemble model by using extratreesclassifier class of sklearn on pima indians diabetes dataset.

first, import the required packages as follows −

from pandas import read_csv
from sklearn.model_selection import kfold
from sklearn.model_selection import cross_val_score
from sklearn.ensemble import extratreesclassifier

now, we need to load the pima diabetes dataset as did in previous examples −

path = r"c:\pima-indians-diabetes.csv"
headernames = ['preg', 'plas', 'pres', 'skin', 'test', 'mass', 'pedi', 'age', 'class']
data = read_csv(path, names=headernames)
array = data.values
x = array[:,0:8]
y = array[:,8]

next, give the input for 10-fold cross validation as follows −

seed = 7
kfold = kfold(n_splits=10, random_state=seed)

we need to provide the number of trees we are going to build. here we are building 150 trees with split points chosen from 5 features −

num_trees = 150
max_features = 5

next, build the model with the help of following script −

model = extratreesclassifier(n_estimators=num_trees, max_features=max_features)

calculate and print the result as follows −

results = cross_val_score(model, x, y, cv=kfold)
print(results.mean())

output

0.7551435406698566

the output above shows that we got around 75.5% accuracy of our bagged extra trees classifier model.

boosting ensemble algorithms

the followings are the two most common boosting ensemble algorithms −

adaboost

it is one the most successful boosting ensemble algorithm. the main key of this algorithm is in the way they give weights to the instances in dataset. due to this the algorithm needs to pay less attention to the instances while constructing subsequent models.

in the following python recipe, we are going to build ada boost ensemble model for classification by using adaboostclassifier class of sklearn on pima indians diabetes dataset.

first, import the required packages as follows −

from pandas import read_csv
from sklearn.model_selection import kfold
from sklearn.model_selection import cross_val_score
from sklearn.ensemble import adaboostclassifier

now, we need to load the pima diabetes dataset as did in previous examples −

path = r"c:\pima-indians-diabetes.csv"
headernames = ['preg', 'plas', 'pres', 'skin', 'test', 'mass', 'pedi', 'age', 'class']
data = read_csv(path, names=headernames)
array = data.values
x = array[:,0:8]
y = array[:,8]

next, give the input for 10-fold cross validation as follows −

seed = 5
kfold = kfold(n_splits=10, random_state=seed)

we need to provide the number of trees we are going to build. here we are building 150 trees with split points chosen from 5 features −

num_trees = 50

next, build the model with the help of following script −

model = adaboostclassifier(n_estimators=num_trees, random_state=seed)

calculate and print the result as follows −

results = cross_val_score(model, x, y, cv=kfold)
print(results.mean())

output

0.7539473684210527

the output above shows that we got around 75% accuracy of our adaboost classifier ensemble model.

stochastic gradient boosting

it is also called gradient boosting machines. in the following python recipe, we are going to build stochastic gradient boostingensemble model for classification by using gradientboostingclassifier class of sklearn on pima indians diabetes dataset.

first, import the required packages as follows −

from pandas import read_csv
from sklearn.model_selection import kfold
from sklearn.model_selection import cross_val_score
from sklearn.ensemble import gradientboostingclassifier

now, we need to load the pima diabetes dataset as did in previous examples −

path = r"c:\pima-indians-diabetes.csv"
headernames = ['preg', 'plas', 'pres', 'skin', 'test', 'mass', 'pedi', 'age', 'class']
data = read_csv(path, names=headernames)
array = data.values
x = array[:,0:8]
y = array[:,8]

next, give the input for 10-fold cross validation as follows −

seed = 5
kfold = kfold(n_splits=10, random_state=seed)

we need to provide the number of trees we are going to build. here we are building 150 trees with split points chosen from 5 features −

num_trees = 50

next, build the model with the help of following script −

model = gradientboostingclassifier(n_estimators=num_trees, random_state=seed)

calculate and print the result as follows −

results = cross_val_score(model, x, y, cv=kfold)
print(results.mean())

output

0.7746582365003418

the output above shows that we got around 77.5% accuracy of our gradient boosting classifier ensemble model.

voting ensemble algorithms

as discussed, voting first creates two or more standalone models from training dataset and then a voting classifier will wrap the model along with taking the average of the predictions of sub-model whenever needed new data.

in the following python recipe, we are going to build voting ensemble model for classification by using votingclassifier class of sklearn on pima indians diabetes dataset. we are combining the predictions of logistic regression, decision tree classifier and svm together for a classification problem as follows −

first, import the required packages as follows −

from pandas import read_csv
from sklearn.model_selection import kfold
from sklearn.model_selection import cross_val_score
from sklearn.linear_model import logisticregression
from sklearn.tree import decisiontreeclassifier
from sklearn.svm import svc
from sklearn.ensemble import votingclassifier

now, we need to load the pima diabetes dataset as did in previous examples −

path = r"c:\pima-indians-diabetes.csv"
headernames = ['preg', 'plas', 'pres', 'skin', 'test', 'mass', 'pedi', 'age', 'class']
data = read_csv(path, names=headernames)
array = data.values
x = array[:,0:8]
y = array[:,8]

next, give the input for 10-fold cross validation as follows −

kfold = kfold(n_splits=10, random_state=7)

next, we need to create sub-models as follows −

estimators = []
model1 = logisticregression()
estimators.append(('logistic', model1))
model2 = decisiontreeclassifier()
estimators.append(('cart', model2))
model3 = svc()
estimators.append(('svm', model3))

now, create the voting ensemble model by combining the predictions of above created sub models.

ensemble = votingclassifier(estimators)
results = cross_val_score(ensemble, x, y, cv=kfold)
print(results.mean())

output

0.7382262474367738

the output above shows that we got around 74% accuracy of our voting classifier ensemble model.

Save or share this article