227 search results - page 19 / 46 » A PAC Bound for Approximate Support Vector Machines |
NIPS
2000
13 years 8 months ago
2000
We introduce a method of feature selection for Support Vector Machines. The method is based upon finding those features which minimize bounds on the leave-one-out error. This sear...
ILP
2007
Springer
14 years 1 months ago
2007
Springer
: This paper is concerned with relational Support Vector Machines, at the intersection of Support Vector Machines (SVM) and relational learning or Inductive Logic Programming (ILP)...
ICML
2003
IEEE
14 years 8 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...
JMLR
2002
13 years 7 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...
NIPS
2004
2004
Class-size Independent Generalization Analsysis of Some Discriminative Multi-Category Classification
13 years 8 months ago
We consider the problem of deriving class-size independent generalization bounds for some regularized discriminative multi-category classification methods. In particular, we obtai...