Nested Dichotomies Based on Clustering
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.
KeywordsNested Dichotomies Binarization Multiclass Problems Supervised Classification
- 3.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)Google Scholar
- 7.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)Google Scholar
- 9.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)Google Scholar
- 11.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