Sparse quadratic classification rules via linear dimension reduction
arXiv:1711.04817 · doi:10.1016/j.jmva.2018.09.011
Abstract
We consider the problem of high-dimensional classification between the two groups with unequal covariance matrices. Rather than estimating the full quadratic discriminant rule, we propose to perform simultaneous variable selection and linear dimension reduction on original data, with the subsequent application of quadratic discriminant analysis on the reduced space. In contrast to quadratic discriminant analysis, the proposed framework doesn't require estimation of precision matrices and scales linearly with the number of measurements, making it especially attractive for the use on high-dimensional datasets. We support the methodology with theoretical guarantees on variable selection consistency, and empirical comparison with competing approaches. We apply the method to gene expression data of breast cancer patients, and confirm the crucial importance of ESR1 gene in differentiating estrogen receptor status.
References in corpus (12)
- Consistency of the group Lasso and multiple kernel learning
- Support union recovery in high-dimensional multivariate regression
- A Selective Review of Group Selection in High-Dimensional Models
- Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors
- Simultaneous sparse estimation of canonical vectors in the p>>N setting
- Exact block-wise optimization in group lasso and sparse group lasso for linear regression
- Optimal variable selection in multi-group sparse discriminant analysis
- Sparse Quadratic Discriminant Analysis and Community Bayes
- Penalized versus constrained generalized eigenvalue problems
- Discriminant Analysis with Adaptively Pooled Covariance
- A New Reduced-Rank Linear Discriminant Analysis Method and Its Applications
- High-Dimensional Regularized Discriminant Analysis