Analysis to Neyman-Pearson classification with convex loss function

Analysis in Theory and Applications

Volumn 24, Issue 1, 2008, Pages 18-28

  Han, Min ^a   Chen, Dirong ^b   Sun, Zhaoxu ^c  

^a BEIJING UNIVERSITY OF TECHNOLOGY   (China)

^b BEIHANG UNIVERSITY   (China)

^c CENTRAL UNIVERSITY OF FINANCE AND ECONOMICS   (China)

Author keywords

Convex loss function; Neyman Pearson classification; Neyman Pearson lemma; NP ERM; Rademacher average

Indexed keywords

EID: 48249090119     PISSN: 16724070     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10496-008-0018-3     Document Type: Article

References (10)

1. Lehmann, E., Testing Statistical Hypothesis, New York: Wiley, 1986.
2. Cannon, A., Howse, J., Hush, D. and Scovel, C., Learning with the Neyman-Pearson and Mim-Max Criteria, Tech. Rep. LA-UR 02-2951, Los Alamos National Laboratory, 2002.
3. Vapnik, V., The Nature of Statistical Learning Theory, New York: Springer-Verlag, 1995.
4. Devroye, L., Györfi, L. and Lugosi, G., A Probabilistic Theory of Pattern Recognition, New York: Springer, 1996.
5. Vapnik, V. and Chervoneukis, A., Theory of Pattern Recognition, Moscow: Nauka, 1974.
6. Vapnik, V. and Chervoneukis, A., On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities, Theory of Probability and its Applications, 16:2(1971), 264-280.
7. Cannon, A., Howse, J., Hush, D. and Scovel, C., Simple Classifiers, Tech. Rep. LA-UR03-0193, Los Alamos National Laboratory, 2003.
8. Vapnik, V. Estimation of Dependencies Based on Empirical Data, New York: Springer-Verlag, 1982.
9. Scott, C. and Nowak, R., A Neyman-Pearson Approach to Statistical Learning, IEEE Transactions on Information Theory, 51:11(2005), 3806-3819.
10. Scott, C., Performance Measures for Neyman-Pearson Classification, Preprint, 2005.