Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Using Uncorrelated Discriminant Analysis for Tissue Classification with Gene Expression Data
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
General Tensor Discriminant Analysis and Gabor Features for Gait Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient and robust feature extraction by maximum margin criterion
IEEE Transactions on Neural Networks
Generalized Linear Discriminant Analysis: A Unified Framework and Efficient Model Selection
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Regularized linear discriminant analysis (RLDA) is a popular LDA-based method for dimension reduction. Despite its good performance, how to choose the parameter of the regularizer efficiently is still unanswered, especially for multi-class situation. In this paper, we first prove that regularizing LDA is equivalent to augmenting the training set in a specific way and thereby propose an efficient model selection criterion based on the principle of maximum information preservation, extensive experiments prove the usefulness and efficiency of our method.