Approximate information discriminant analysis: A computationally simple heteroscedastic feature extraction technique
From MaRDI portal
Publication:2476565
DOI10.1016/J.PATCOG.2007.10.001zbMATH Open1140.68460OpenAlexW1968780149MaRDI QIDQ2476565FDOQ2476565
Authors: Koel Das, Zoran Nenadic
Publication date: 20 March 2008
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2007.10.001
Recommendations
- A linear discriminant analysis method based on mutual information maximization
- Feature informativeness, curse-of-dimensionality and error probability in discriminant analysis
- Feature Informativeness in High-Dimensional Discriminant Analysis
- On the relation between discriminant analysis and mutual information for supervised linear feature extraction
- A computationally efficient scheme for feature extraction with kernel discriminant analysis
- Heteroscedastic linear feature extraction based on sufficiency conditions
entropyclassificationlinear discriminant analysismutual informationinformation theoryfeature extractionBayes error
Cites Work
- Pattern classification.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A direct LDA algorithm for high-dimensional data -- with application to face recognition
- Statistical Properties of Error Estimators in Performance Assessment of Recognition Systems
- 10.1162/153244303322753742
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probability of error, equivocation, and the Chernoff bound
- Title not available (Why is that?)
- Linear dimension reduction and Bayes classification with unknown population parameters
Cited In (4)
Uses Software
This page was built for publication: Approximate information discriminant analysis: A computationally simple heteroscedastic feature extraction technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476565)