2002 RoundRobinClassification

Subject Headings: Round Robin Classification Algorithm, All-vs-All Multiclass Supervised Classification Algorithm.

Notes

In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifier for each pair of classes. We present an empirical evaluation of the method, implemented as a wrapper around the Ripper rule learning algorithm, on 20 multi-class datasets from the UCI database repository. Our results show that the technique is very likely to improve Ripper's classification accuracy without having a high risk of decreasing it. More importantly, we give a general theoretical analysis of the complexity of the approach and show that its run-time complexity is below that of the commonly used one-against-all technique. These theoretical results are not restricted to rule learning but are also of interest to other communities where pairwise classification has recently received some attention. Furthermore, we investigate its properties as a general ensemble technique and show that round robin classification with C5.0 may improve C5.0's performance on multi-class problems. However, this improvement does not reach the erformance increase of boosting, and a combination of boosting and round robin classification does not produce any gain over conventional boosting. Finally, we show that the performance of round robin classification can be further improved by a straight-forward integration with bagging.

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2002 RoundRobinClassification	Johannes Fürnkranz			Round Robin Classification.		The Journal of Machine Learning Research	http://www.jmlr.org/papers/volume2/fuernkranz02a/fuernkranz02a.pdf	10.1162/153244302320884605		2002