335 search results - page 1 / 67 » Kernel Machines and Boolean Functions |
ALT
2001
Springer
14 years 2 months ago
2001
Springer
This paper concerns the design of a Support Vector Machine (SVM) appropriate for the learning of Boolean functions. This is motivated by the need of a more sophisticated algorithm ...
NIPS
2001
13 years 6 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
COLT
2003
Springer
13 years 10 months ago
2003
Springer
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
COLT
2008
Springer
13 years 6 months ago
2008
Springer
A kernel over the Boolean domain is said to be reflection-invariant, if its value does not change when we flip the same bit in both arguments. (Many popular kernels have this prop...
NIPS
2001
13 years 6 months ago
2001
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...