Neyman-Pearson Multi-Class Classification via Cost-Sensitive Learning

DOI10.1080/01621459.2024.2402567MaRDI QIDQ6970784zbMATH OpenFDO

Authors Ye Tian, Yang Feng

Publication date 17 June 2025

Published in Journal of the American Statistical Association (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01621459.2024.2402567

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• `` Direct Search Solution of Numerical and Statistical Problems
• A flexible model-free prediction-based framework for feature ranking
• A generalized Neyman-Pearson criterion for optimal domain adaptation
• A Neyman–Pearson Approach to Statistical Learning
• A plug-in approach to Neyman-Pearson classification
• A Simplex Method for Function Minimization
• A survey on Neyman-Pearson classification and suggestions for future research
• Asymptotic Statistics
• Fast learning rates for plug-in classifiers
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Intentional control of type I error over unconscious data distortion: a Neyman-Pearson approach to text classification
• Maximum likelihood in cost-sensitive learning: model specification, approximations, and upper bounds
• Neyman-Pearson classification under high-dimensional settings
• Neyman-Pearson classification, convexity and stochastic constraints
• Neyman-Pearson classification: parametrics and sample size requirement
• Note on the Consistency of the Maximum Likelihood Estimate
• Performance Measures for Neyman–Pearson Classification

Cited in

(1)

• Sparse robust discriminant analysis for high-dimensional and heavy-tailed data

This page was built for publication: Neyman-Pearson Multi-Class Classification via Cost-Sensitive Learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970784)