An Efficient Greedy Search Algorithm for High-Dimensional Linear Discriminant Analysis
From MaRDI portal
Publication:6069872
Cites work
- A direct approach to sparse discriminant analysis in ultra-high dimensions
- A direct estimation approach to sparse linear discriminant analysis
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A road to classification in high dimensional space: the regularized optimal affine discriminant
- CODA: high dimensional copula discriminant analysis
- Covariance regularization by thresholding
- Integrative linear discriminant analysis with guaranteed error rate improvement
- Multiclass sparse discriminant analysis
- Penalized classification using Fisher's linear discriminant
- Robust estimation of high-dimensional covariance and precision matrices
- Some theory for Fisher's linear discriminant function, `naive Bayes', and some alternatives when there are many more variables than observations
- Sparse linear discriminant analysis by thresholding for high dimensional data
- Sparse Quadratic Discriminant Analysis For High Dimensional Data
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
Cited in
(2)
This page was built for publication: An Efficient Greedy Search Algorithm for High-Dimensional Linear Discriminant Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6069872)