Sciweavers

Share
18 search results - page 2 / 4
» Sparse Kernel SVMs via Cutting-Plane Training
Sort
View
DAGM
2007
Springer
9 years 2 months ago
Greedy-Based Design of Sparse Two-Stage SVMs for Fast Classification
Cascades of classifiers constitute an important architecture for fast object detection. While boosting of simple (weak) classifiers provides an established framework, the design of...
Rezaul Karim, Martin Bergtholdt, Jörg H. Kapp...
CVPR
2009
IEEE
1976views Computer Vision» more  CVPR 2009»
10 years 5 months ago
Linear Spatial Pyramid Matching Using Sparse Coding for Image Classification
Recently SVMs using spatial pyramid matching (SPM) kernel have been highly successful in image classification. Despite its popularity, these nonlinear SVMs have a complexity O(n...
Jianchao Yang, Kai Yu, Yihong Gong, Thomas S. Huan...
ESANN
2004
8 years 11 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
NIPS
2003
8 years 11 months ago
Sparseness of Support Vector Machines---Some Asymptotically Sharp Bounds
The decision functions constructed by support vector machines (SVM’s) usually depend only on a subset of the training set—the so-called support vectors. We derive asymptotical...
Ingo Steinwart
IJCNN
2008
IEEE
9 years 4 months ago
Sparse support vector machines trained in the reduced empirical feature space
— We discuss sparse support vector machines (sparse SVMs) trained in the reduced empirical feature space. Namely, we select the linearly independent training data by the Cholesky...
Kazuki Iwamura, Shigeo Abe
books