High-dimensional quadratic classifiers in non-sparse settings
We consider high-dimensional quadratic classifiers in non-sparse settings. The target of classification rules is not Bayes error rates in the context. The classifier based on the Mahalanobis distance does not always give a preferable performance even if the populations are normal distributions having known covariance matrices. The quadratic classifiers proposed in this paper draw information about heterogeneity effectively through both the differences of expanding mean vectors and covariance matrices. We show that they hold a consistency property in which misclassification rates tend to zero as the dimension goes to infinity under non-sparse settings. We verify that they are asymptotically distributed as a normal distribution under certain conditions. We also propose a quadratic classifier after feature selection by using both the differences of mean vectors and covariance matrices. Finally, we discuss performances of the classifiers in actual data analyses. The proposed classifiers achieve highly accurate classification with very low computational costs.
Code (0)
등록된 구현이 없습니다.
Tasks
feature selectionGeneral ClassificationVocal Bursts Intensity PredictionSimilar Papers 제목 키워드 기반
BIG & QUIC: Sparse Inverse Covariance Estimation for a Million Variables
The l1-regularized Gaussian maximum likelihood estimator (MLE) has been shown to have strong statistical guarantees in recovering a sparse inverse covariance matrix even under high-dimensional settings. However, it requi…
ClusteringInteraction Hard Thresholding: Consistent Sparse Quadratic Regression in Sub-quadratic Time and Space
Quadratic regression involves modeling the response as a (generalized) linear function of not only the features $x^{j_1}$ but also of quadratic terms $x^{j_1}x^{j_2}$. The inclusion of such higher-order "interaction term…
regressionQuadratically Regularized Optimal Transport: Localization Bounds and Affine Case Analysis
Quadratic regularization has emerged as a potential alternative to the popular entropic regularization in computational optimal transport, offering the theoretical advantage of producing sparse couplings through its hing…
Support Recovery in Mixture Models with Sparse Parameters
Mixture models are widely used to fit complex and multimodal datasets. In this paper we study mixtures with high dimensional sparse latent parameter vectors and consider the problem of support recovery of those vectors. …
parameter estimationSparse Quadratic Discriminant Analysis and Community Bayes
We develop a class of rules spanning the range between quadratic discriminant analysis and naive Bayes, through a path of sparse graphical models. A group lasso penalty is used to introduce shrinkage and encourage a simi…
General Classification