Approximate information discriminant analysis: A computationally simple heteroscedastic feature extraction technique

DOI10.1016/J.PATCOG.2007.10.001MaRDI QIDQ2476565zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

entropyclassificationlinear discriminant analysismutual informationinformation theoryfeature extractionBayes error

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

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

Cites work

• scientific article; zbMATH DE number 47593 (Why is no real title available?)
• scientific article; zbMATH DE number 49608 (Why is no real title available?)
• scientific article; zbMATH DE number 3641625 (Why is no real title available?)
• scientific article; zbMATH DE number 837698 (Why is no real title available?)
• scientific article; zbMATH DE number 3052156 (Why is no real title available?)
• 10.1162/153244303322753742
• A direct LDA algorithm for high-dimensional data -- with application to face recognition
• Linear dimension reduction and Bayes classification with unknown population parameters
• Pattern classification.
• Probability of error, equivocation, and the Chernoff bound
• Statistical Properties of Error Estimators in Performance Assessment of Recognition Systems

Cited in

(4)

• Brain-computer interfaces for human gait restoration
• Bias reduction and metric learning for nearest-neighbor estimation of Kullback-Leibler divergence
• Regularized discriminant entropy analysis
• Heteroscedastic linear feature extraction based on sufficiency conditions

Describes a project that uses

Uses Software

• UCI

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)