Borda Count Aggregation
Borda Count Ensemble Aggregation · Also known as: weighted voting, rank aggregation
Borda count is a preference aggregation method that combines ranked predictions from multiple classifiers by assigning points based on ranking position. Each classifier ranks the possible outcomes, and each class receives points inversely proportional to its rank position. The class with the highest total score is selected. Originally proposed by French mathematician Jean-Charles de Borda in 1781, this method has been adapted for ensemble learning to aggregate soft predictions and rank-ordered outputs.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Use Borda count when base classifiers output probability scores or confidence rankings, and when you want to reward models that correctly identify top candidates even if they do not rank them first. It is particularly useful for multi-class problems and when the confidence distribution carries important information. Avoid it if classifiers only output hard predictions without confidence, as it degenerates to simple majority voting.
Strengths & limitations
- Exploits rich ranking information from soft predictions, not just hard class labels.
- Robust to classifier biases—a model's overall ranking preference is captured, not just its top choice.
- Mathematically sound foundation in social choice theory and preference aggregation.
- Naturally handles ties by distributing points across all classes.
- Requires probability scores or rankings from base classifiers; not applicable to hard voting-only models.
- Sensitivity to ranking inconsistencies: small differences in probability scores can significantly alter rankings.
- Computational cost scales with the number of classes—point calculation increases for larger label spaces.
- May be less effective than weighted ensemble methods that explicitly optimize classifier weights.
Frequently asked
How do I assign points in Borda count?
Standard Borda count assigns n points to rank 1, n-1 to rank 2, etc. Alternatives include exponential (2^n to 2^1) or logarithmic schemes. The choice depends on whether you want to penalize lower ranks heavily (exponential) or gently (logarithmic).
Can Borda count handle missing rankings?
Yes, if some classifiers do not rank all classes (e.g., only output top-k predictions), assign zero points to unranked classes. Ensure consistency: either all models rank all classes or use a unified handling rule for missing ranks.
What is the difference between Borda count and weighted averaging?
Borda count uses rank position to assign points, while weighted averaging directly multiplies each classifier's output by its learned or predefined weight. Borda count is non-parametric; weighted averaging often optimizes weights on validation data.
Does Borda count suffer from the Condorcet paradox?
Yes, Borda count can violate the Condorcet criterion: the winning class may not beat all others pairwise. This is a known limitation of rank aggregation methods. In ensemble learning, validation performance usually takes precedence over theoretical consistency.
Sources
- Borda, J. C. de (1781). Mémoire sur les élections au scrutin. Histoire de l'Académie Royale des Sciences. link ↗
- Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the web. Proceedings of the 10th International Conference on World Wide Web, 613-622. DOI: 10.1145/371920.372165 ↗
How to cite this page
ScholarGate. (2026, June 3). Borda Count Ensemble Aggregation. ScholarGate. https://scholargate.app/en/ensemble-learning/borda-count-aggregation
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.
- Majority VotingEnsemble Learning↔ compare
- Stacked GeneralizationEnsemble Learning↔ compare
- WEIGHTED-VOTINGDecision-making↔ compare