Sparse Quadratic Discriminant Analysis For High Dimensional Data
From MaRDI portal
(Redirected from Publication:3449010)
Recommendations
- Sparse linear discriminant analysis by thresholding for high dimensional data
- A convex optimization approach to high-dimensional sparse quadratic discriminant analysis
- Quadratic Discriminant Analysis for High-Dimensional Data
- A direct approach for sparse quadratic discriminant analysis
- Sparse quadratic classification rules via linear dimension reduction
Cited in
(35)- Covariate-adjusted tensor classification in high dimensions
- A \(U\)-classifier for high-dimensional data under non-normality
- Distance-based classifier by data transformation for high-dimension, strongly spiked eigenvalue models
- Ridge-forward quadratic discriminant analysis in high-dimensional situations
- Geometric classifiers for high-dimensional noisy data
- New hard-thresholding rules based on data splitting in high-dimensional imbalanced classification
- Quadratic discriminant analysis by projection
- The robust nearest shrunken centroids classifier for high-dimensional heavy-tailed data
- How can we identify the sparsity structure pattern of high-dimensional data: an elementary statistical analysis to interpretable machine learning
- A fast iterative algorithm for high-dimensional differential network
- High dimensional classification for spatially dependent data with application to neuroimaging
- Efficient computation for differential network analysis with applications to quadratic discriminant analysis
- A direct approach for sparse quadratic discriminant analysis
- SURE estimates for high dimensional classification
- RaSE: random subspace ensemble classification
- scientific article; zbMATH DE number 7387552 (Why is no real title available?)
- Likelihood-Based Dimension Folding on Tensor Data
- Covariance-engaged classification of sets via linear programming
- Quadratic Discriminant Analysis for High-Dimensional Data
- Sparse quadratic classification rules via linear dimension reduction
- An Efficient Greedy Search Algorithm for High-Dimensional Linear Discriminant Analysis
- Statistical insights into deep neural network learning in subspace classification
- Statistical inference under the strongly spiked eigenvalue model
- A review of quadratic discriminant analysis for high-dimensional data
- Linear discriminant analysis with sparse and dense signals
- Dynamic Supervised Principal Component Analysis for Classification
- High dimensional discriminant analysis under weak sparsity
- High-dimensional differential networks with sparsity and reduced-rank
- QDA classification of high-dimensional data with rare and weak signals
- Quadratic discriminant analysis in distributed frameworks
- The Tucker low-rank classification model for tensor data
- Non-splitting Neyman-Pearson classifiers
- Sparse robust discriminant analysis for high-dimensional and heavy-tailed data
- Ultrahigh-dimensional quadratic discriminant analysis using random projections
- A convex optimization approach to high-dimensional sparse quadratic discriminant analysis
This page was built for publication: Sparse Quadratic Discriminant Analysis For High Dimensional Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449010)