Neyman-Pearson classification under high-dimensional settings
From MaRDI portal
Recommendations
- A plug-in approach to Neyman-Pearson classification
- Neyman-Pearson classification: parametrics and sample size requirement
- Neyman-Pearson classification, convexity and stochastic constraints
- Analysis to Neyman-Pearson classification with convex loss function
- A Neyman–Pearson Approach to Statistical Learning
Cited in
(12)- On two simple and effective procedures for high dimensional classification of general populations
- A plug-in approach to Neyman-Pearson classification
- Analysis to Neyman-Pearson classification with convex loss function
- A Neyman–Pearson Approach to Statistical Learning
- Neyman-Pearson classification: parametrics and sample size requirement
- A flexible model-free prediction-based framework for feature ranking
- Neyman-Pearson classification, convexity and stochastic constraints
- Intentional control of type I error over unconscious data distortion: a Neyman-Pearson approach to text classification
- Asymmetric Error Control Under Imperfect Supervision: A Label-Noise-Adjusted Neyman–Pearson Umbrella Algorithm
- Attack detection and fault-tolerant control of interconnected cyber-physical systems against simultaneous replayed time-delay and false-data injection attacks
- Neyman-Pearson Multi-Class Classification via Cost-Sensitive Learning
- Non-splitting Neyman-Pearson classifiers
This page was built for publication: Neyman-Pearson classification under high-dimensional settings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953636)