Abstract
Multiclass problems, i.e., classification problems involving more than two classes, are a common scenario in supervised classification. An important approach to solve this type of problems consists in using binary classifiers repeated times; within this category we find nested dichotomies. However, most of the methods for building nested dichotomies use a random strategy, which does not guarantee finding a good one. In this work, we propose new non-random methods for building nested dichotomies, using the idea of reducing misclassification errors by separating in the higher levels those classes that are easier to separate; and, in the lower levels those classes that are more difficult to separate. In order to evaluate the performance of the proposed methods, we compare them against methods that randomly build nested dichotomies, using some datasets (with mixed data) taken from the UCI repository.
Chapter PDF
Similar content being viewed by others
References
Hastie, T., Tibshirani, R.: Classification by pairwise coupling. Ann. Statist. 26(2), 451–471 (1998)
Rifkin, R., Klautau, A.: In defense of one-vs-all classification. J. Mach. Learn. Res. 5, 101–141 (2004)
Frank, E., Kramer, S.: Ensembles of Balanced Nested Dichotomies for Multi-class Problems. In: 21st International Conference on Machine Learning, ICML 2004, pp. 305–312. ACM, New York (2004)
Dong, L., Frank, E., Kramer, S.: Ensembles of Balanced Nested Dichotomies for Multi-class Problems. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol. 3721, pp. 84–95. Springer, Heidelberg (2005)
Rodrguez, J.J., Garca-Osorio, C., Maudes, J.: Forests of Nested Dichotomies. Pat. Rec. Lett. 31(2), 125–132 (2010)
Breiman, L.: Bagging predictors. Mach. Learn. 24(2), 123–140 (1996)
Freund, Y., Schapire, R.E.: Game theory, on-line prediction and boosting. In: 9th Annual Conference on Computational Learning Theory, COLT 1996, pp. 325–332 (1996)
Webb, G.I.: MultiBoosting: A Technique for Combining Boosting and Wagging. Mach. Learn. 40(2), 159–196 (2000)
Kazuaki, A., Mineichi, K.: A top-down construction of class decision trees with selected features and classifiers. In: International Conference on High Performance Computing and Simulation, HPCS, pp. 390–398 (2010)
Wilson, D.R., Martinez, T.R.: Improved heterogeneous distance functions. J. Art. Intell. Res. 6, 1–34 (1997)
Frank, A., Asuncion, A.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2010), http://archive.ics.uci.edu/ml
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duarte-Villaseñor, M.M., Carrasco-Ochoa, J.A., Martínez-Trinidad, J.F., Flores-Garrido, M. (2012). Nested Dichotomies Based on Clustering. In: Alvarez, L., Mejail, M., Gomez, L., Jacobo, J. (eds) Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. CIARP 2012. Lecture Notes in Computer Science, vol 7441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33275-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-33275-3_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33274-6
Online ISBN: 978-3-642-33275-3
eBook Packages: Computer ScienceComputer Science (R0)