1037 search results - page 59 / 208 » Learning of Boolean Functions Using Support Vector Machines |
NIPS
2000
13 years 9 months ago
2000
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
This paper presents an approach to build Sparse Large Margin Classifiers (SLMC) by adding one more constraint to the standard Support Vector Machine (SVM) training problem. The ad...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
FUIN
2011
12 years 11 months ago
2011
In this article, a novel concept is introduced by using both unsupervised and supervised learning. For unsupervised learning, the problem of fuzzy clustering in microarray data as ...
NIPS
2003
13 years 9 months ago
2003
Nonlinear filtering can solve very complex problems, but typically involve very time consuming calculations. Here we show that for filters that are constructed as a RBF network ...