Skip to contentScholarGate
LibraryBookshelfDeskReview StudioAssistant
Sign in
On this page
IntuitionHow it worksWhen to use itStrengths & limitationsCommon pitfallsApplicationsFrequently asked🔒 Read the full methodSourcesRelated methods
Cite this pageSpotted an issue on this page? Report or suggest a fix →
Home›Machine learning›Voting Ensemble
Machine learningMachine learning

Voting Ensemble

Voting Ensemble (Majority and Weighted Voting of Multiple Classifiers) · Also known as: majority voting classifier, hard voting, soft voting ensemble, plurality voting ensemble

A voting ensemble trains several diverse classifiers independently and combines their predictions by a vote: hard voting picks the class chosen by the most models, while soft voting averages their class-probability estimates, optionally with per-model weights. The combination usually outperforms any individual member, and requires no additional training after the base models are fitted.

ScholarGate
  1. Machine learning
  2. v1
  3. 2 Sources
  4. PUBLISHED
Cite this page →
Tools & resources
Download slides
Learn & explore

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Method map

The neighbourhood of related methods — select a node to explore.

Voting Ensemble
BaggingBoostingExtra TreesRandom ForestStackingActive learning Stacking…Active Learning Voting E…Association RulesBayesian BaggingBayesian Stacking Ensemb…

+24 more

When to use it

Use a voting ensemble when you have two or more already-trained diverse classifiers and want a quick, interpretable combination with no extra training cost. It is especially valuable when individual models have similar average accuracy but different error profiles — combining them yields genuine gains. Soft voting is preferable when base models output calibrated probabilities. Do not use voting ensembles as a substitute for proper model selection: if all base learners are weak or make correlated errors, combining them will not help. Avoid when interpretability of a single model is required by stakeholders or regulation.

Strengths & limitations

Strengths
  • Simple to implement: no meta-learner training needed beyond fitting the base models.
  • Often improves accuracy and robustness over any single base learner when members are diverse.
  • Soft voting exploits probability calibration, typically outperforming hard voting.
  • Supports heterogeneous model families, allowing any combination of classifiers.
  • Easy to add or remove base learners without retraining the ensemble infrastructure.
Limitations
  • Gains are minimal or absent when base learners make highly correlated errors.
  • Soft voting requires that all base learners output calibrated, comparable probability estimates.
  • Inference cost scales linearly with the number of base learners; large ensembles can be slow.
  • No mechanism to learn optimal combination weights automatically — unlike stacking, weights must be set manually.

Frequently asked

How many base learners should I include?

There is no fixed rule, but three to seven diverse classifiers is a common practical range. Adding more learners beyond a point of diminishing returns increases inference latency without meaningfully improving accuracy.

When should I prefer soft voting over hard voting?

Use soft voting when all base learners produce well-calibrated probability outputs — it typically yields higher accuracy because it uses the full probability distribution rather than just the winning class. If probabilities are poorly calibrated or unavailable, hard voting is safer.

How do I choose the weights in weighted soft voting?

A simple approach is to weight each model by its cross-validated accuracy or AUC on the training set. More principled approaches optimise weights via a held-out validation set, but risk overfitting if the validation set is small.

How is voting ensemble different from stacking?

Voting ensembles combine base model outputs with fixed rules (majority or average). Stacking trains a meta-learner on the base model outputs to learn the optimal combination — more powerful but more complex and prone to data leakage if cross-validation is not used correctly.

Does diversity always improve the ensemble?

Diversity is necessary but not sufficient. Base learners must also be individually accurate; an ensemble of weak, diverse classifiers can still perform poorly. The goal is diverse errors among accurate models.

Sources

  1. Kuncheva, L. I. (2004). Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience. ISBN: 978-0-471-21078-8
  2. Dietterich, T. G. (2000). Ensemble Methods in Machine Learning. In J. Kittler & F. Roli (Eds.), Multiple Classifier Systems (MCS 2000), Lecture Notes in Computer Science, vol 1857, pp. 1–15. Springer. DOI: 10.1007/3-540-45014-9_1 ↗

How to cite this page

ScholarGate. (2026, June 3). Voting Ensemble (Majority and Weighted Voting of Multiple Classifiers). ScholarGate. https://scholargate.app/en/machine-learning/voting-ensemble

Related methods

BaggingBoostingExtra TreesRandom ForestStacking

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

  • BaggingMachine learning↔ compare
  • BoostingMachine learning↔ compare
  • Extra TreesMachine learning↔ compare
  • Random ForestMachine learning↔ compare
  • StackingMachine learning↔ compare
Compare side by side →

Referenced by

Active learning Stacking ensembleActive Learning Voting EnsembleAssociation RulesBayesian BaggingBayesian Stacking EnsembleBoostingEnsemble Active LearningEnsemble Association RulesEnsemble Autoencoder Anomaly DetectionEnsemble Decision TreeEnsemble Federated LearningEnsemble Few-shot learningEnsemble Gaussian ProcessEnsemble Isolation ForestEnsemble K-nearest neighborsEnsemble Linear RegressionEnsemble Logistic RegressionEnsemble Metric LearningEnsemble Naive BayesEnsemble One-class SVMEnsemble Online LearningEnsemble Semi-supervised LearningEnsemble Support Vector MachineEnsemble Transfer LearningExplainable Voting EnsembleOnline Voting EnsembleRegularized Stacking EnsembleRobust BaggingRobust Voting EnsembleSemi-supervised Voting Ensemble

Similar methods

Majority VotingRobust Voting EnsembleExplainable Voting EnsembleEnsemble Logistic RegressionSemi-supervised Voting EnsembleEnsemble Support Vector MachineEnsemble Decision TreeOnline Voting Ensemble

Related reference concepts

Ensemble MethodsCross-ValidationCross-Validation and ResamplingSupervised LearningModel Evaluation and SelectionClassification Algorithms

Spotted an issue on this page? Report or suggest a fix →

ScholarGate — Voting Ensemble (Voting Ensemble (Majority and Weighted Voting of Multiple Classifiers)). Retrieved 2026-07-21 from https://scholargate.app/en/machine-learning/voting-ensemble · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originator
Lam & Suen; Kuncheva, L. I. (systematic treatment)
Year
1990s–2004
Type
Ensemble (combination of multiple classifiers by vote)
DataType
Tabular, categorical targets (classification); extensions for regression
Subfamily
Machine learning
Related methods
BaggingBoostingExtra TreesRandom ForestStacking
ScholarGate

A content-first reference library for research methods — what each one is, how it works, and where it comes from.

Open data (CC-BY)

Explore

  • Library
  • Search the library…
  • Browse by field
  • Fields
  • Journey
  • Compare
  • Which method?

Reference

  • Subjects
  • Atlas
  • Glossary
  • Methodology
  • Philosophy

Your tools

  • Bookshelf
  • Desk
  • Chat

Company

  • About
  • Pricing
  • Contact
  • Suggest a method

Entries are compiled from published sources for reference. Verifying the accuracy and suitability of any information for your own use remains your responsibility.

© 2026 ScholarGate · A research-method reference library
  • Privacy
  • Cookies
  • Terms
  • Delete account