Subclass discriminant analysis
Over the years, many Discriminant Analysis ( DA) algorithms have been proposed for the study of high- dimensional data in a large variety of problems. Each of these algorithms is tuned to a specific type of data distribution ( that which best models the problem at hand). Unfortunately, in most problems the form of each class pdf is a priori unknown, and the selection of the DA algorithm that best fits our data is done over trial- and- error. Ideally, one would like to have a single formulation which can be used for most distribution types. This can be achieved by approximating the underlying distribution of each class with a mixture of Gaussians. In this approach, the major problem to be addressed is that of determining the optimal number of Gaussians per class, i. e., the number of subclasses. In this paper, two criteria able to find the most convenient division of each class into a set of subclasses are derived. Extensive experimental results are shown using five databases. Comparisons are given against Linear Discriminant Analysis ( LDA), Direct LDA ( DLDA), Heteroscedastic LDA ( HLDA), Nonparametric DA ( NDA), and Kernel- Based LDA ( K- LDA). We show that our method is always the best or comparable to the best.
discriminant analysis mixture of gaussians feature extraction pattern recognition classification eigenvalue decomposition stability criterion