Performance Measures for Neyman–Pearson Classification

DOI10.1109/TIT.2007.901152zbMATH Open1326.94030MaRDI QIDQ3549031FDOQ3549031

Authors: Clayton Scott 

Publication date: 21 December 2008

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

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 (7)

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

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)