Sciweavers

365 search results - page 18 / 73
» Generalized Chebyshev Kernels for Support Vector Classificat...
Sort
View
JMLR
2006
150views more  JMLR 2006»
13 years 7 months ago
Building Support Vector Machines with Reduced Classifier Complexity
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...
S. Sathiya Keerthi, Olivier Chapelle, Dennis DeCos...
ICANN
2007
Springer
13 years 11 months ago
Resilient Approximation of Kernel Classifiers
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...
Thorsten Suttorp, Christian Igel
JSS
2008
317views more  JSS 2008»
13 years 7 months ago
Predicting defect-prone software modules using support vector machines
Effective prediction of defectprone software modules can enable software developers to focus quality assurance activities and allocate effort and resources more efficiently. Supp...
Karim O. Elish, Mahmoud O. Elish
CAIP
2009
Springer
210views Image Analysis» more  CAIP 2009»
13 years 11 months ago
Shape Classification Using a Flexible Graph Kernel
The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junctio...
François-Xavier Dupé, Luc Brun
CVPR
2008
IEEE
14 years 9 months ago
Enforcing non-positive weights for stable support vector tracking
In this paper we demonstrate that the support vector tracking (SVT) framework first proposed by Avidan is equivalent to the canonical Lucas-Kanade (LK) algorithm with a weighted E...
Simon Lucey