Linear dimensionality reduction techniques have been studied very well for the two-class problem, while the corresponding issues encountered when dealing with multiple classes are far from trivial. In this paper, we show that dealing with multiple classes, it is not expedient to treat it as a multi-class problem, but it is better to treat it as an ensemble of Chernoff-based two-class reductions onto different subspaces. The solution is achieved by resorting to either Voting, Weighting, or a Decision Tree combination scheme. The ensemble methods were tested on benchmark datasets demonstrating that the proposed method is not only efficient, but also yields an accuracy comparable to that obtained by the optimal Bayes classifier.

Additional Metadata
Keywords Chernoff distance, Fisher's discriminant analysis, Heteroscedastic discriminant analysis, Linear dimensionality reduction
Persistent URL dx.doi.org/10.1007/978-3-540-85920-8_37
Series Lecture Notes in Computer Science
Citation
Rueda, L. (Luis), HenrĂ­quez, C. (Claudio), & Oommen, J. (2008). Chernoff-based multi-class pairwise linear dimensionality reduction. In Lecture Notes in Computer Science. doi:10.1007/978-3-540-85920-8_37