0% found this document useful (0 votes)
84 views4 pages

Overview of Ensemble Learning Methods

Ensemble learning combines multiple machine learning models to obtain better predictive performance than could be obtained from any of the constituent models alone. There are several reasons to use ensemble methods, including being able to integrate models that perform better on different parts of the dataset, having more robust predictions when data is limited, and producing more accurate predictions by combining the strengths of different algorithms. Common ensemble methods include bagging, boosting, and stacking. Bagging trains models in parallel on random subsets of data and aggregates their predictions, boosting trains models sequentially to focus on misclassified examples, and stacking uses the predictions of multiple models to train a final meta-model.

Uploaded by

LOGESH WARAN P
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
84 views4 pages

Overview of Ensemble Learning Methods

Ensemble learning combines multiple machine learning models to obtain better predictive performance than could be obtained from any of the constituent models alone. There are several reasons to use ensemble methods, including being able to integrate models that perform better on different parts of the dataset, having more robust predictions when data is limited, and producing more accurate predictions by combining the strengths of different algorithms. Common ensemble methods include bagging, boosting, and stacking. Bagging trains models in parallel on random subsets of data and aggregates their predictions, boosting trains models sequentially to focus on misclassified examples, and stacking uses the predictions of multiple models to train a final meta-model.

Uploaded by

LOGESH WARAN P
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Ensemble Methods

Ensemble Learning is a method of reaching a consensus in predictions by fusing the salient


properties of two or more models. The final ensemble learning framework is more robust
than the individual models that constitute the ensemble because ensembling reduces the
variance in

Here are some of the scenarios where ensemble learning comes in handy.

1. Can't choose an “optimal” model


There may arise situations where different models perform better on some distributions
within the dataset, say, for example, a model may be well adapted to differentiate between
cats and dogs, but not so much when distinguishing between dogs and wolves.

On the other hand, a second model can accurately differentiate between dogs and wolves
while producing wrong predictions on the “cat” class. An ensemble of these two models
might draw a more discriminative decision boundary between all the three classes of the data.

2. Excess/Shortage of data
In cases where a substantial amount of data is available, we may divide the classification
tasks between different classifiers and ensemble them during prediction time, rather than
trying to train one classifier with large volumes of data.

On the other hand, in cases where the dataset available is small (for example, in the
biomedical domain, where acquiring labeled medical data is costly), we can use a
bootstrapping ensemble strategy. ‍

3. Confidence Estimation
The very core of an ensemble framework is based on the confidence in predictions by the
different models. For example, when trying to draw a consensus between four models on a
cat/dog classification problem, if two models predict the sample as class “cat” and the other
two predict as “dog,” the confidence of the ensemble is low.
4. High Problem Complexity
Sometimes, a problem can have a complex decision boundary, and it might become
impossible for a single classifier to generate the appropriate boundary. An example of such a
case is shown in the diagram below.
5. Information Fusion

Models that have been trained on different distributions of data pertaining to the same set of
classes are employed during prediction time to get a more robust decision. For example, we
may have trained one cat/dog classifier on high-quality images taken by a professional
photographer. In contrast, another classifier has been trained on data using low-quality photos
captured on mobile phones. When predicting a new sample, integrating the decisions from
both these classifiers will be more robust and bias-free.

Commonly used Ensemble Methods:

1. Bagging

The Bagging ensemble technique is the acronym for “bootstrap aggregating” and is one of the
earliest ensemble methods proposed.

For this method, subsamples from a dataset are created and they are called “bootstrap
sampling.” To put it simply, random subsets of a dataset are created using replacement,
meaning that the same data point may be present in several subsets. These subsets are now
treated as independent datasets, on which several Machine Learning models will be fit.
During test time, the predictions from all such models trained on different subsets of the same
data are accounted for. There is an aggregation mechanism used to compute the final
prediction (like averaging, weighted averaging, etc.).

Bagging

The image shown above exemplifies the Bagging ensemble mechanism.

Note that, in the bagging mechanism, a parallel stream of processing occurs. The main aim of
the bagging method is to reduce variance in the ensemble predictions.

Thus, the chosen ensemble classifiers usually have high variance and low bias (complex
models with many trainable parameters). Popular ensemble methods based on this approach
include:
 Bagged Decision Trees
 Random Forest Classifiers
 Extra Trees

2. Boosting

The boosting ensemble mechanism works in a way markedly different from the bagging
mechanism.

Here, instead of parallel processing of data, sequential processing of the dataset occurs. The
first classifier is fed with the entire dataset, and the predictions are analyzed.

The instances where Classifier-1 fails to produce correct predictions (that are samples near
the decision boundary of the feature space) are fed to the second classifier.

This is done so that Classifier-2 can specifically focus on the problematic areas of feature
space and learn an appropriate decision boundary. Similarly, further steps of the same idea
are employed, and then the ensemble of all these previous classifiers is computed to make the
final prediction on the test data.

The pictorial representation of the same is shown below.

Boosting ensemble mechanism

The main aim of the boosting method is to reduce bias in the ensemble decision. Thus, the
classifiers are chosen for the ensemble usually need to have low variance and high bias, i.e.,
simpler models with less trainable parameters.
Other algorithms based on this approach include:

 Adaptive Boosting
 Stochastic Gradient Boosting
 Gradient Boosting Machines

3. Stacking

The stacking ensemble method also involves creating bootstrapped data subsets, like the
bagging ensemble mechanism for training multiple models.

However, here, the outputs of all such models are used as an input to another classifier, called
meta-classifier, which finally predicts the samples. The intuition behind using two layers of
classifiers is to determine whether the training data have been appropriately learned.

For example, in the example of the cat/dog/wolf classifier at the beginning of this article, if,
say, Classifier-1 can distinguish between cats and dogs, but not between dogs and wolves, the
meta-classifier present in the second layer will be able to capture this behavior from
classifier-1. The meta classifier can then correct this behavior before making the final
prediction.

A pictorial representation of the stacking mechanism is shown below.

Boosting ensemble mechanism

The diagram above shows one level of stacking. There are also multi-level stacking ensemble
methods where additional layers of classifiers are added in between.

However, such practices become computationally very expensive for a relatively small boost
in performance.‍

Other methods – Mixture of Experts, Majority Voting, Max Rule, Probability Averaging,
Weighted Probability Averaging etc.

Common questions

Powered by AI

Bagging involves parallel processing of data where each model is trained on random subsets created through bootstrap sampling. This method reduces variance as it combines predictions from multiple high variance, low bias models such as decision trees or random forests . Conversely, boosting uses sequential processing, focusing subsequent models on correcting mistakes made by previous models. This reduces bias in ensemble predictions by using simpler models with high bias and low variance .

An ensemble strategy is recommended in cases of complex decision boundaries, varying data distributions, and small datasets. For instance, with small datasets common in domains like biomedical research, bootstrapping techniques in ensembles are useful. Bagging is suitable for scenarios with high dataset variance due to its parallel processing and ability to reduce variance. Conversely, boosting is apt for scenarios where reducing model bias is crucial; it focuses on sequentially improving poorly predicted samples. Finally, stacking is ideal for evaluating and correcting biases from the first layer model predictions, using a meta-classifier on the combined outputs of multiple models .

Bagging methods, like Random Forests, take advantage of averaging several uncorrelated decisions generated from bootstrap sampling to yield robust predictions. The use of random subsets reduces overfitting by diversifying decision trees, leading to lower variance in predictions. Additionally, bagging is conducive to exploiting high variance, low bias models' strengths, delivering stable and accurate outputs across various distributions without the complexities associated with model dependencies inherent in boosting .

Stacking becomes computationally expensive because it adds layers of classifiers, wherein each layer processes the predictions of previous layers. This increases complexity, requiring more computation and time, especially if multi-level stacking is involved. However, the cost is justified by the potential to improve accuracy and robustness by using a meta-classifier to address weaknesses in primary classifiers' predictions, allowing for a more nuanced final decision .

The primary goal of bagging is to reduce prediction variance by aggregating predictions from diverse models to average out errors from high variance classifiers, such as decision trees, using independent dataset subsets . Boosting, on the other hand, aims to minimize bias by sequentially adjusting the models to focus on and correct errors made by predecessors, hence incrementally lowering prediction errors by tackling difficult samples more effectively .

Mixture of experts and majority voting differ in their strategy by focusing on specialized decision-making and aggregating simple votes, respectively, as opposed to combining model outputs based on variance/bias trade-offs. Mixture of experts assigns different models to specialize in different input subsets, while majority voting aggregates simple predictions without weighting or sequential corrections as in boosting. These methods provide quick, intuitive ensemble strategies that may not require the extensive computation of errors or complexity balancing needed in boosting/bagging, making them suitable for simpler applications or initial model testing phases .

Stacking provides the benefit of robust final predictions by enabling a meta-classifier to refine predictions from base classifiers, thus improving accuracy where individual models fail. However, it presents challenges in terms of increased computational cost and complexity, particularly with multilayer architectures where computational resources and time become significant factors. Furthermore, tuning the meta-classifier to optimally combine predictions requires careful analysis and validation, which can be more involved than simpler ensemble methods like bagging or boosting .

Confidence estimation plays a pivotal role by allowing ensemble models to evaluate the consensus among predictions. For example, if a dataset's models have an equal split in their predictions (e.g., two predict 'cat' and two predict 'dog'), it indicates low ensemble confidence, possibly prompting the need for additional models or refined models to enhance consensus and accuracy. Therefore, confidence estimation ensures that predictions reflect a balanced decision drawing from all component models, optimizing decision accuracy .

Ensemble learning can improve decision boundaries by combining multiple models that address different aspects of the feature space. For example, when one model might effectively classify cats and dogs but struggle with separating dogs and wolves, another model might excel in distinguishing between dogs and wolves. An ensemble of these models would draw a more accurate decision boundary across all classes .

Information fusion in ensemble learning leverages classifiers trained on varied data distributions – such as high-quality versus low-quality image datasets – to produce a consensus prediction that is more robust to biases inherent in individual datasets. This approach ensures that the final ensemble prediction considers a broader range of feature representations and contextualizes individual model limitations, resulting in a more resilient decision boundary .

You might also like