22 search results - page 1 / 5 » Resilient Approximation of Kernel Classifiers |
ICANN
2007
Springer
13 years 8 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...
CVPR
2008
IEEE
14 years 6 months ago
2008
IEEE
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can ...
ICPR
2004
IEEE
14 years 5 months ago
2004
IEEE
The likelihood for patterns of continuous attributes for the naive Bayesian classifier (NBC) may be approximated by kernel density estimation (KDE), letting every pattern influenc...
ANNPR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In our previous work we have shown that Mahalanobis kernels are useful for support vector classifiers both from generalization ability and model selection speed. In this ...
JMLR
2006
13 years 4 months ago
2006
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...