A general procedure for combining binary classifiers and its performance analysis

Authors:
Hai Zhao;Bao-Liang Lu
Affiliations:
Departmart of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Departmart of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part I
Year:
2005

Citing 3
Cited 1

Reducing multiclass to binary: a unifying approach for margin classifiers

The Journal of Machine Learning Research
Round robin classification

The Journal of Machine Learning Research
Task decomposition and module combination based on class relations: a modular neural network for pattern classification

IEEE Transactions on Neural Networks

Adaptive ensemble learning strategy using an assistant classifier for large-scale imbalanced patent categorization

ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

A general procedure for combining binary classifiers for multiclass classification problems with one-against-one decomposition policy is presented in this paper. Two existing schemes, namely the min-max combination and the most-winning combination, may be regarded as its two special cases. We show that the accuracy of the combination procedure will increase and time complexity will decrease as its main parameter increases under a proposed selection algorithm. The experiments verify our main results, and our theoretical analysis gives a valuable criterion for choosing different schemes of combining binary classifiers.