2190 search results - page 1 / 438 » Learning with the Set Covering Machine |
ICML
2001
IEEE
14 years 5 months ago
2001
IEEE
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
JMLR
2002
13 years 4 months ago
2002
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
ECML
2005
Springer
13 years 10 months ago
2005
Springer
We propose a new learning algorithm for the set covering machine and a tight data-compression risk bound that the learner can use for choosing the appropriate tradeoff between the ...
ICML
2003
IEEE
14 years 5 months ago
2003
IEEE
We examine the set covering machine when it uses data-dependent half-spaces for its set of features and bound its generalization error in terms of the number of training errors an...
ICML
2010
IEEE
13 years 5 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...