An efficient algorithm to solve the small sample size problem for LDA
From MaRDI portal
(Redirected from Publication:1887709)
Recommendations
- A direct LDA algorithm for high-dimensional data -- with application to face recognition
- Improving implementation of linear discriminant analysis for the high dimension/small sample size problem
- WAVELET-FACE BASED SUBSPACE LDA METHOD TO SOLVE SMALL SAMPLE SIZE PROBLEM IN FACE RECOGNITION
- An efficient discriminant-based solution for small sample size problem
- A comparison of generalized linear discriminant analysis algorithms
Cites work
Cited in
(14)- A note on kernel uncorrelated discriminant analysis
- MBLDA: a novel multiple between-class linear discriminant analysis
- Generalized null space uncorrelated Fisher discriminant analysis for linear dimensionality reduction
- A novel kernel-based maximum a posteriori classification method
- A generalised K-L expansion method which can deal with small sample size and high-dimensional problems
- A study on three linear discriminant analysis based methods in small sample size problem
- A direct LDA algorithm for high-dimensional data -- with application to face recognition
- An efficient discriminant-based solution for small sample size problem
- A comparison of generalized linear discriminant analysis algorithms
- Class-Incremental Generalized Discriminant Analysis
- Why direct LDA is not equivalent to LDA
- Feature extraction using constrained maximum variance mapping
- Locally linear discriminant embedding: An efficient method for face recognition
- Feature extraction using two-dimensional local graph embedding based on maximum margin criterion
This page was built for publication: An efficient algorithm to solve the small sample size problem for LDA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887709)