Abstract
Pairwise classification is a class binarization procedure that converts a multi-class problem into a series of two-class problems, one problem for each pair of classes. While it can be shown that for training, this procedure is more efficient than the more commonly used one-against-all approach, it still has to evaluate a quadratic number of classifiers when computing the predicted class for a given example. In this paper, we propose a method that allows a faster computation of the predicted class when weighted or unweighted voting are used for combining the predictions of the individual classifiers. While its worst-case complexity is still quadratic in the number of classes, we show that even in the case of completely random base classifiers, our method still outperforms the conventional pairwise classifier. For the more practical case of well-trained base classifiers, its asymptotic computational complexity seems to be almost linear.
Chapter PDF
Similar content being viewed by others
References
Cutzu, F.: How to do multi-way classification with two-way classifiers. In: Kaynak, O., Alpaydın, E., Oja, E., Xu, L. (eds.) ICANN 2003 and ICONIP 2003. LNCS, vol. 2714, pp. 375–384. Springer, Heidelberg (2003a)
Cutzu, F.: Polychotomous classification with pairwise classifiers: A new voting principle. In: Proceedings of the 4th International Workshop on Multiple Classifier Systems, pp. 115–124. Springer, Berlin (2003b)
Fürnkranz, J.: Round robin classification. Journal of Machine Learning Research 2, 721–747 (2002)
Fürnkranz, J.: Round robin ensembles. Intelligent Data Analysis 7, 385–404 (2003)
Hastie, T., Tibshirani, R.: Classification by pairwise coupling. In: Advances in Neural Information Processing Systems 10 (NIPS-97), pp. 507–513. MIT Press, Cambridge (1998)
Hettich, S., Blake, C.L., Merz, C.J.: UCI repository of machine learning databases. Department of Information and Computer Science, University of California at Irvine, Irvine CA (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
Hsu, C.-W., Lin, C.-J.: A comparison of methods for multi-class support vector machines. IEEE Transactions on Neural Networks 13, 415–425 (2002)
Hüllermeier, E., Fürnkranz, J.: Ranking by pairwise comparison: A note on risk minimization. In: Proceedings of the IEEE International Conference on Fuzzy Systems (FUZZ-IEEE-2004), Budapest, Hungary (2004)
Park, S.-H., Fürnkranz, J.: Efficient Pairwise Classification and Ranking. Technical Report TUD-KE-2007-3. Knowledge Engineering Group, TU Darmstadt (2007)
Platt, J.C., Cristianini, N., Shawe-Taylor, J.: Large margin DAGs for multiclass classification. In: Advances in Neural Information Processing Systems 12 (NIPS-99), pp. 547–553. MIT Press, Cambridge (2000)
Witten, I.H., Frank, E.: Data mining — practical machine learning tools and techniques with Java implementations, 2nd edn. Morgan Kaufmann Publishers, San Francisco (2005)
Wu, T.-F., Lin, C.-J., Weng, R.C.: Probability estimates for multi-class classification by pairwise coupling. Journal of Machine Learning Research 5, 975–1005 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, SH., Fürnkranz, J. (2007). Efficient Pairwise Classification. In: Kok, J.N., Koronacki, J., Mantaras, R.L.d., Matwin, S., Mladenič, D., Skowron, A. (eds) Machine Learning: ECML 2007. ECML 2007. Lecture Notes in Computer Science(), vol 4701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74958-5_65
Download citation
DOI: https://doi.org/10.1007/978-3-540-74958-5_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74957-8
Online ISBN: 978-3-540-74958-5
eBook Packages: Computer ScienceComputer Science (R0)