972 search results - page 4 / 195 » Active Learning with Generalized Queries |
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
JCSS
2007
13 years 7 months ago
2007
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
CIKM
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...