An Efficient Greedy Search Algorithm for High-Dimensional Linear Discriminant Analysis

DOI10.5705/ss.202021.0028OpenAlexW4200252317WikidataQ113689317 ScholiaQ113689317MaRDI QIDQ6069872

D. Y. Lin, Unnamed Author, Quefeng Li

Publication date: 17 November 2023

Published in: Statistica Sinica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5705/ss.202021.0028

zbMATH Keywords

variable selectionMahalanobis distancelinear discriminant analysisgreedy searchhigh-dimensional classification

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Sparse linear discriminant analysis by thresholding for high dimensional data
• Covariance regularization by thresholding
• Some theory for Fisher's linear discriminant function, `naive Bayes', and some alternatives when there are many more variables than observations
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Penalized Classification using Fisher’s Linear Discriminant
• A direct approach to sparse discriminant analysis in ultra-high dimensions
• A Direct Estimation Approach to Sparse Linear Discriminant Analysis
• Sparse Quadratic Discriminant Analysis For High Dimensional Data
• Integrative linear discriminant analysis with guaranteed error rate improvement
• Multiclass Sparse Discriminant Analysis
• Robust estimation of high-dimensional covariance and precision matrices
• A Road to Classification in High Dimensional Space: The Regularized Optimal Affine Discriminant