Information, Prediction, and Query by Committee
نویسندگان
چکیده
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 holds for query learning of thresholded smooth functions.
منابع مشابه
Selective sampling using the Query by Committee algorithmRunning title : Selective sampling using Query
We analyze the \query by committee" algorithm, a method for ltering 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 holds for query learning of perceptrons.
متن کاملSelective sampling using the Query by Committee algorithmRunning title :
We analyze the \query by committee" algorithm, a method for ltering 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 holds for query learning of perceptrons.
متن کاملQEA: A New Systematic and Comprehensive Classification of Query Expansion Approaches
A major problem in information retrieval is the difficulty to define the information needs of user and on the other hand, when user offers your query there is a vast amount of information to retrieval. Different methods , therefore, have been suggested for query expansion which concerned with reconfiguring of query by increasing efficiency and improving the criterion accuracy in the information...
متن کاملQuery expansion based on relevance feedback and latent semantic analysis
Web search engines are one of the most popular tools on the Internet which are widely-used by expert and novice users. Constructing an adequate query which represents the best specification of users’ information need to the search engine is an important concern of web users. Query expansion is a way to reduce this concern and increase user satisfaction. In this paper, a new method of query expa...
متن کاملPrediction of Seismic Wave Intensity Generated by Bench Blasting Using Intelligence Committee Machines
In large open pit mines prediction of Peak Particle Velocity (PPV) provides useful information for safe blasting. At Sungun Copper Mine (SCM), some unstable rock slopes facing to valuable industrial facilities are both expose to high intensity daily blasting vibrations, threatening their safty. So, controlling PPV by developing accurate predictors is essential. Hence, this study proposes improv...
متن کامل