Sciweavers

77 search results - page 10 / 16
» Efficient Large Scale Linear Programming Support Vector Mach...
Sort
View
ESANN
2008
13 years 10 months ago
On related violating pairs for working set selection in SMO algorithms
Sequential Minimal Optimization (SMO) is currently the most popular algorithm to solve large quadratic programs for Support Vector Machine (SVM) training. For many variants of this...
Tobias Glasmachers
CIKM
2000
Springer
14 years 28 days ago
Scalable association-based text classification
Naïve Bayes (NB) classifier has long been considered a core methodology in text classification mainly due to its simplicity and computational efficiency. There is an increasing n...
Dimitris Meretakis, Dimitris Fragoudis, Hongjun Lu...
ECCV
2010
Springer
14 years 1 hour ago
Efficient object category recognition using classemes
We introduce a new descriptor for images which allows the construction of efficient and compact classifiers with good accuracy on object category recognition. The descriptor is the...
JMLR
2006
93views more  JMLR 2006»
13 years 8 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg
JMLR
2006
89views more  JMLR 2006»
13 years 8 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel