Neyman-Pearson classification, convexity and stochastic constraints

Details Neyman-Pearson classification, convexity and stochastic constraints Neyman-Pearson classification, convexity and stochastic constraints

2011-02-28

arxiv.org/abs/1102.5750v1

Statistics

Machine Learning

Scientific paper

Motivated by problems of anomaly detection, this paper implements the Neyman-Pearson paradigm to deal with asymmetric errors in binary classification with a convex loss. Given a finite collection of classifiers, we combine them and obtain a new classifier that satisfies simultaneously the two following properties with high probability: (i) its probability of type I error is below a pre-specified level and (ii), it has probability of type II error close to the minimum possible. The proposed classifier is obtained by solving an optimization problem with an empirical objective and an empirical constraint. New techniques to handle such problems are developed and have consequences on chance constrained programming.

Affiliated with

Also associated with

No associations

Rating

Neyman-Pearson classification, convexity and stochastic constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Neyman-Pearson classification, convexity and stochastic constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Neyman-Pearson classification, convexity and stochastic constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-426288