Threshold rules for online sample selection

Details Threshold rules for online sample selection Threshold rules for online sample selection

2010-02-26

arxiv.org/abs/1002.5034v2

Computer Science

Data Structures and Algorithms

Scientific paper

We consider the following sample selection problem. We observe in an online fashion a sequence of samples, each endowed by a quality. Our goal is to either select or reject each sample, so as to maximize the aggregate quality of the subsample selected so far. There is a natural trade-off here between the rate of selection and the aggregate quality of the subsample. We show that for a number of such problems extremely simple and oblivious "threshold rules" for selection achieve optimal tradeoffs between rate of selection and aggregate quality in a probabilistic sense. In some cases we show that the same threshold rule is optimal for a large class of quality distributions and is thus oblivious in a strong sense.

Affiliated with

Also associated with

No associations

Rating

Threshold rules for online sample selection 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 Threshold rules for online sample selection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Threshold rules for online sample selection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-290141