Kernel Query By Committee (KQBC)

Kernel Query By Committee (KQBC) (2003)

Cached

Download Links

by Ran Gilad-bachrach , Amir Navot , Naftali Tishby

Citations:

BibTeX

@TECHREPORT{Gilad-bachrach03kernelquery,
    author = {Ran Gilad-bachrach and Amir Navot and Naftali Tishby},
    title = {Kernel Query By Committee (KQBC)},
    institution = {},
    year = {2003}
}

Bookmark

OpenURL

Abstract

The Query By Committee (QBC) algorithm is among the few algorithms in the active learning framework that has some theoretical justification.

Citations

1656	CJC: A Tutorial on Support Vector Machines for Pattern Recognition - Burges - 1998
1515	A theory of the learnable - Valiant - 1984
507	An Introduction to Computational Learning Theory - Kearns, Vazirani - 1994
334	Improving generalization with active learning - Cohn, Atlas, et al. - 1994
256	Selective sampling using the query by committee algorithm, Machine Learning 28 - Freund, Seung, et al. - 1997
253	Constant Depth Circuits, Fourier Transform, and Learnability - Linial, Mansour, et al. - 1993
243	Smopolinsky H: Query by committee - Seung, Opper - 1992
96	Mistake bounds and logarithmic linear-threshold learning algorithms - Littlestone - 1989
93	Committee-based sampling for training probabilistic classifiers - Dagan, Engelson - 1995
70	Active learning with committees for text categorization - Liere, Tadepalli - 1997
52	Random walks and an O ∗ (n 5 ) volume algorithm for convex bodies. Random Struct. Algorithms - Kannan, Lovász, et al. - 1997
38	D: Active Learning for Structure in Bayesian Networks - Tong, Koller
31	A geometric inequality and the complexity of computing volume - Elekes - 1986
30	Active learning for automatic speech recognition - Hakkani-Tür, Riccardi, et al. - 2002
29	Query learning can work poorly when a human oracle is used - Baum, Lang - 1993
29	Random walks and an O (n ) volume algorithm for convex bodies, Random Structures & Algorithms - Kannan, Lov'asz, et al.
16	Query by committee, linear separation and random walks - Fine, Gilad-Bachrach, et al. - 2002
13	Learning from queries for maximum information gain in imperfectly learnable problems - Sollich, Saad - 1995
9	The kernel gibbs sampler - Graepel, Herbrich - 2001
1	Random walks and anÓ£�volume algorithm for convex bodies. Random Structures and Algorithms - Kannan, Lovasz, et al. - 1997