Abstract
When dealing with multi-class classification tasks, a popular and applicable way is to decompose the original problem into a set of binary subproblems. The most well-known decomposition strategy is one-against-one and the corresponding widely-used method to recombine the outputs of all binary classifiers is pairwise coupling (PWC). However PWC has an intrinsic shortcoming; many meaningless partial classification results contribute to the global prediction result. Moreira and Mayoraz suggested to tackle this problem by using correcting classifiers [4]. Though much better performance was obtained, their algorithm is simple and has some disadvantages. In this paper, we propose a novel algorithm which works in two steps: First the original pairwise probabilities are converted into a new set of pairwise probabilities, then pairwise coupling is employed to construct the global posterior probabilities. Employing support vector machines as binary classifiers, we perform investigation on several benchmark datasets. Experimental results show that our algorithm is effective and efficient.
This work is supported by the National Natural Science Foundation of China under grant No. 60072029 and No.60271033.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Weston, J., Watkins, C.: Support Vector Machines for Multi-Class Pattern Recognition. In: Proc. of 7th European Sympo. on Artificial Neural Networks (1999)
Platt, J., Cristianini, N., Shawe-Taylor, J.: Large Margin DAGs for Multiclass Classification. Advance in Neural Information Processing Systems 12, 547–553 (2000)
Hsu, C.-W., Lin, C.-J.: A comparison of methods for multi-class support vector machines. IEEE Trans. on Neural Networks 13, 415–425 (2002)
Moreira, M., Mayoraz, E.: Improved Pairwise Coupling Classification with Correcting Classifiers. In: Proc. of the 10th Europen Conf. on Machine Learning, pp. 160–171 (1998)
Friedman, J.: Another Approach to Polychotomous Classification. Technical report, Stanford University (1996)
Hastie, T., Tibshirani, R.: Classification by Pairwise Coupling. The Annals of Statistics 26, 451–471 (1998)
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)
Michie, D., Spiegelhalter, D.J., Taylor, C.C.: Machine Learning, Neural and Statistical Classification. Ellis Horwood, London (1994), Data available at ftp://ftp.ncc.up.pt/pub/statlog
Platt, J.: Probabilistic Outputs for Support Vector Machines and Comparison to Regularized Likelihood Methods. In: Smola, A.J., Bartlett, P.L., Schölkopf, B., Schuurmans, D. (eds.) Advances in Large Margin Classifiers, pp. 61–74. MIT Press, Cambridge (2000)
Chang, C.-C., Lin, C.-J.: LIBSVM: A Library for Support Vector Machines (2002), Online at http://www.csie.ntu.edu.tw/cjlin/papers/libsvm.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, H., Qi, F., Wang, S. (2005). Improved Pairwise Coupling Support Vector Machines with Correcting Classifiers. In: Gelbukh, A., de Albornoz, Á., Terashima-Marín, H. (eds) MICAI 2005: Advances in Artificial Intelligence. MICAI 2005. Lecture Notes in Computer Science(), vol 3789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11579427_46
Download citation
DOI: https://doi.org/10.1007/11579427_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29896-0
Online ISBN: 978-3-540-31653-4
eBook Packages: Computer ScienceComputer Science (R0)