Weighted linear programming discriminant analysis for high‐dimensional binary classification
From MaRDI portal
Weighted linear programming discriminant analysis for high‐dimensional binary classification
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A direct approach to sparse discriminant analysis in ultra-high dimensions
- A direct estimation approach to sparse linear discriminant analysis
- A road to classification in high dimensional space: the regularized optimal affine discriminant
- Adaptive Lasso for sparse high-dimensional regression models
- Comparison of Discrimination Methods for High Dimensional Data
- High-dimensional classification using features annealed independence rules
- Penalized classification using Fisher's linear discriminant
- Some theory for Fisher's linear discriminant function, `naive Bayes', and some alternatives when there are many more variables than observations
- Sure independence screening for ultrahigh dimensional feature space. With discussion and authors' reply
- Sure independence screening in generalized linear models with NP-dimensionality
- The Kolmogorov filter for variable screening in high-dimensional binary classification
Cited in
(2)
This page was built for publication: Weighted linear programming discriminant analysis for high‐dimensional binary classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4970346)