Analysis to Neyman-Pearson classification with convex loss function

DOI10.1007/S10496-008-0018-3MaRDI QIDQ3538596zbMATH OpenOpenAlexFDO

Authors Min Han, Di-Rong Chen, Zhao Sun

Publication date 24 November 2008

Published in Analysis in Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10496-008-0018-3

zbMATH Keywords

Neyman-Pearson lemmaRademacher average

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Nonparametric inference (62G99)

Recommendations

• Classification with Gaussians and convex loss
• Neyman-Pearson classification, convexity and stochastic constraints
• scientific article; zbMATH DE number 1140602
• Neyman-Pearson classification under high-dimensional settings
• Analysis of loss functions in support vector machines
• Convexity, Classification, and Risk Bounds
• A note on margin-based loss functions in classification
• The C-loss function for pattern classification
• High-dimensional regression and classification under a class of convex loss functions
• Conjugate relation between loss functions and uncertainty sets in classification problems

Cites work

• scientific article; zbMATH DE number 3984308 (Why is no real title available?)
• scientific article; zbMATH DE number 823069 (Why is no real title available?)
• scientific article; zbMATH DE number 893887 (Why is no real title available?)
• A Neyman–Pearson Approach to Statistical Learning
• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Performance Measures for Neyman–Pearson Classification

Cited in

(9)

• Classification with Gaussians and convex loss
• A survey on Neyman-Pearson classification and suggestions for future research
• Rademacher complexity in Neyman-Pearson classification
• Neyman-Pearson classification: parametrics and sample size requirement
• Neyman-Pearson classification, convexity and stochastic constraints
• A plug-in approach to Neyman-Pearson classification
• A Neyman–Pearson Approach to Statistical Learning
• Convergence Analysis of Two Loss Functions in Soft-Max Regression
• Neyman-Pearson classification under high-dimensional settings

This page was built for publication: Analysis to Neyman-Pearson classification with convex loss function

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