Sciweavers

445 search results - page 3 / 89
» A Bayesian Committee Machine
Sort
View
EUROCOLT
1999
Springer
13 years 10 months ago
Query by Committee, Linear Separation and Random Walks
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
Ran Bachrach, Shai Fine, Eli Shamir
COLT
1992
Springer
13 years 9 months ago
Query by Committee
We propose an algorithm called query by committee, in which a committee of students is trained on the same data set. The next query is chosen according to the principle of maximal...
H. Sebastian Seung, Manfred Opper, Haim Sompolinsk...
SIGIR
2002
ACM
13 years 5 months ago
Document clustering with committees
Document clustering is useful in many information retrieval tasks: document browsing, organization and viewing of retrieval results, generation of Yahoo-like hierarchies of docume...
Patrick Pantel, Dekang Lin
JMLR
2012
11 years 8 months ago
Bayesian Comparison of Machine Learning Algorithms on Single and Multiple Datasets
We propose a new method for comparing learning algorithms on multiple tasks which is based on a novel non-parametric test that we call the Poisson binomial test. The key aspect of...
Alexandre Lacoste, François Laviolette, Mar...