The candidate examples that lead to the most disagreements among the different learners are considered to have the highest TUV ( Cohn , Atlas , and Ladner 1994 ; Freund et al. 1997 ) .
selective sampling using the query by committee algorithm
Yoav Freund H Sebastian Seung Eli Shamir Naftali Tishby
A committee-based selection algorithm works with multiple learners , each maintaining a different hypothesis ( perhaps pertaining to different aspects of the problem ) . The candidate examples that lead to the most disagreements among the different learners are considered to have the highest TUV ( Cohn , Atlas , and Ladner 1994 ; Freund et al. 1997 ) . For computationally intensive problems , such as parsing , keeping multiple learners may be impractical .
The candidate examples that lead to the most disagreements among the different learners are considered to have the highest TUV ( Cohn , Atlas , and Ladner 1994 ; @@CITATION ) .