Data-adaptive binary classifiers in high dimensions using random partitioning
From MaRDI portal
Cites work
- A direct LDA algorithm for high-dimensional data -- with application to face recognition
- A high-dimensional classification rule using sample covariance matrix equipped with adjusted estimated eigenvalues
- A knockoff filter for high-dimensional selective inference
- A note on data-splitting for the evaluation of significance levels
- Application of non parametric empirical Bayes estimation to high dimensional classification
- Benchmark for filter methods for feature selection in high-dimensional classification data
- Class prediction by nearest shrunken centroids, with applications to DNA microarrays.
- Estimation of the precision matrix of a singular Wishart distribution and its application in high-dimensional data
- False Discovery Rate Control via Data Splitting
- High-dimensional classification using features annealed independence rules
- High-dimensional classification via nonparametric empirical Bayes and maximum likelihood inference
- High-dimensional variable selection
- scientific article; zbMATH DE number 3483405 (Why is no real title available?)
- Penalized classification using Fisher's linear discriminant
- Probability Inequalities for Sums of Bounded Random Variables
- Randomized Algorithms for Matrices and Data
- Regularized linear discriminant analysis and its application in microarrays
- Sketching as a tool for numerical linear algebra
- Some theory for Fisher's linear discriminant function, `naive Bayes', and some alternatives when there are many more variables than observations
- Sufficient dimension reduction via random-partitions for the large-\(p\)-small-\(n\) problem
- The maximal data piling direction for discrimination
This page was built for publication: Data-adaptive binary classifiers in high dimensions using random partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6967464)
