CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2005 vol.27 Issue No.12 - December
Issue No.12 - December (2005 vol.27)
Anand Narasimhamurthy , IEEE
A number of earlier studies that have attempted a theoretical analysis of majority voting assume independence of the classifiers. We formulate the majority voting problem as an optimization problem with linear constraints. No assumptions on the independence of classifiers are made. For a binary classification problem, given the accuracies of the classifiers in the team, the theoretical upper and lower bounds for performance obtained by combining them through majority voting are shown to be solutions of the corresponding optimization problem. The objective function of the optimization problem is nonlinear in the case of an even number of classifiers when rejection is allowed, for the other cases the objective function is linear and hence the problem is a linear program (LP). Using the framework we provide some insights and investigate the relationship between two candidate classifier diversity measures and majority voting performance.
Index Terms- Classifier design and evaluation, Majority voting, theoretical bounds, classifier diversity measures.
Anand Narasimhamurthy, "Theoretical Bounds of Majority Voting Performance for a Binary Classification Problem", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.27, no. 12, pp. 1988-1995, December 2005, doi:10.1109/TPAMI.2005.249