When is the majority-vote classifier beneficial?

07/24/2013
by   Mu Zhu, et al.
0

In his seminal work, Schapire (1990) proved that weak classifiers could be improved to achieve arbitrarily high accuracy, but he never implied that a simple majority-vote mechanism could always do the trick. By comparing the asymptotic misclassification error of the majority-vote classifier with the average individual error, we discover an interesting phase-transition phenomenon. For binary classification with equal prior probabilities, our result implies that, for the majority-vote mechanism to work, the collection of weak classifiers must meet the minimum requirement of having an average true positive rate of at least 50 50

READ FULL TEXT

page 4

page 13

research
09/18/2020

Ensemble of Binary Classifiers Combined Using Recurrent Correlation Associative Memories

An ensemble method should cleverly combine a group of base classifiers t...
research
10/21/2020

How to Control the Error Rates of Binary Classifiers

The traditional binary classification framework constructs classifiers w...
research
02/18/2022

On The "Majority is Least Stable" Conjecture

We show that the "majority is least stable" conjecture is true for n=1 a...
research
05/25/2018

Multiview Learning of Weighted Majority Vote by Bregman Divergence Minimization

We tackle the issue of classifier combinations when observations have mu...
research
12/01/2022

High Dimensional Binary Classification under Label Shift: Phase Transition and Regularization

Label Shift has been widely believed to be harmful to the generalization...
research
05/26/2015

Some Open Problems in Optimal AdaBoost and Decision Stumps

The significance of the study of the theoretical and practical propertie...
research
06/02/2023

Streaming algorithms for evaluating noisy judges on unlabeled data – binary classification

The evaluation of noisy binary classifiers on unlabeled data is treated ...

Please sign up or login with your details

Forgot password? Click here to reset