Selecting a number of voters for a voting ensemble

04/23/2021
by   Eric Bax, et al.
0

For a voting ensemble that selects an odd-sized subset of the ensemble classifiers at random for each example, applies them to the example, and returns the majority vote, we show that any number of voters may minimize the error rate over an out-of-sample distribution. The optimal number of voters depends on the out-of-sample distribution of the number of classifiers in error. To select a number of voters to use, estimating that distribution then inferring error rates for numbers of voters gives lower-variance estimates than directly estimating those error rates.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/16/2021

A Dataset-Level Geometric Framework for Ensemble Classifiers

Ensemble classifiers have been investigated by many in the artificial in...
research
10/04/2016

Ensemble Validation: Selectivity has a Price, but Variety is Free

If classifiers are selected from a hypothesis class to form an ensemble,...
research
03/04/2013

A Sharp Bound on the Computation-Accuracy Tradeoff for Majority Voting Ensembles

When random forests are used for binary classification, an ensemble of t...
research
11/15/2017

Efficient Estimation of Generalization Error and Bias-Variance Components of Ensembles

For many applications, an ensemble of base classifiers is an effective s...
research
07/17/2018

A Mathematical Model for Optimal Decisions in a Representative Democracy

Direct democracy is a special case of an ensemble of classifiers, where ...
research
09/09/2017

Less Is More: A Comprehensive Framework for the Number of Components of Ensemble Classifiers

The number of component classifiers chosen for an ensemble has a great i...
research
06/10/2019

On the Insufficiency of the Large Margins Theory in Explaining the Performance of Ensemble Methods

Boosting and other ensemble methods combine a large number of weak class...

Please sign up or login with your details

Forgot password? Click here to reset