227 search results - page 15 / 46 » A PAC Bound for Approximate Support Vector Machines |
TNN
2008
13 years 7 months ago
2008
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
ECCC
2000
13 years 7 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
ICANN
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
ML
2002
ACM
13 years 7 months ago
2002
ACM
In this paper, we elaborate on the well-known relationship between Gaussian Processes (GP) and Support Vector Machines (SVM) under some convex assumptions for the loss functions. ...