Performance Measures for Neyman–Pearson Classification

DOI10.1109/TIT.2007.901152MaRDI QIDQ3549031zbMATH OpenFDO

Authors Clayton Scott

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2007.901152

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(10)

• The false discovery rate for statistical pattern recognition
• Analysis to Neyman-Pearson classification with convex loss function
• Classification with minimum ambiguity under distribution heterogeneity
• Controlling the error probabilities of model selection information criteria using bootstrapping
• Overlaying classifiers: A practical approach to optimal scoring
• Radial kernels and their reproducing kernel Hilbert spaces
• A survey on Neyman-Pearson classification and suggestions for future research
• Error control and Neyman-Pearson classification with buffered probability and support vectors
• Neyman-Pearson Multi-Class Classification via Cost-Sensitive Learning
• Non-splitting Neyman-Pearson classifiers

This page was built for publication: Performance Measures for Neyman–Pearson Classification

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