227 search results - page 26 / 46 » A PAC Bound for Approximate Support Vector Machines |
NIPS
2007
13 years 8 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—The need to quickly and accurately classify Internet traffic for security and QoS control has been increasing significantly with the growing Internet traffic and applications ov...
AMAI
2004
Springer
14 years 24 days ago
2004
Springer
The Minimax Probability Machine (MPM) constructs a classifier, which provides a worst-case bound on the probability of misclassification of future data points based on reliable ...
AAAI
2006
13 years 8 months ago
2006
We propose a simple mechanism for incorporating advice (prior knowledge), in the form of simple rules, into support-vector methods for both classification and regression. Our appr...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...