227 search results - page 26 / 46 » A PAC Bound for Approximate Support Vector Machines |
145
click to vote
NIPS
2007
15 years 7 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...
171
click to vote
ICC
2007
IEEE
16 years 9 days 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...
176
click to vote
AMAI
2004
Springer
15 years 11 months 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 ...
136
click to vote
AAAI
2006
15 years 7 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...
176
click to vote
IPPS
2009
IEEE
16 years 19 days 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...