Analysis to Neyman-Pearson classification with convex loss function
DOI10.1007/S10496-008-0018-3zbMATH Open1164.62358OpenAlexW1981135886MaRDI QIDQ3538596FDOQ3538596
Zhao Sun, Min Han, Di-Rong Chen
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
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Nonparametric inference (62G99)
Cites Work
- Title not available (Why is that?)
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- A Neyman–Pearson Approach to Statistical Learning
- Performance Measures for Neyman–Pearson Classification
Cited In (4)
Recommendations
- Classification with Gaussians and convex loss 👍 👎
- Neyman-Pearson classification, convexity and stochastic constraints 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- 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 👍 👎
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)