Selective Sampling Using the Query by Committee Algorithm


We analyze the “query by committee” algorithm, a method for filtering informative queries from a random stream of inputs. We show that if the two-member committee algorithm achieves information gain with positive lower bound, then the prediction error decreases exponentially with the number of queries. We show that, in particular, this exponential decrease… (More)
DOI: 10.1023/A:1007330508534


6 Figures and Tables


Citations per Year

980 Citations

Semantic Scholar estimates that this publication has 980 citations based on the available data.

See our FAQ for additional information.