Sciweavers

65 search results - page 4 / 13
» Multi-Objective Programming in SVMs
Sort
View
ICASSP
2008
IEEE
14 years 2 months ago
Nested support vector machines
The one-class and cost-sensitive support vector machines (SVMs) are state-of-the-art machine learning methods for estimating density level sets and solving weighted classificatio...
Gyemin Lee, Clayton Scott
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
13 years 11 months ago
Evolving kernels for support vector machine classification
While support vector machines (SVMs) have shown great promise in supervised classification problems, researchers have had to rely on expert domain knowledge when choosing the SVM&...
Keith Sullivan, Sean Luke
IJCNN
2006
IEEE
14 years 1 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
ICML
2009
IEEE
14 years 8 months ago
Learning structural SVMs with latent variables
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application prob...
Chun-Nam John Yu, Thorsten Joachims
JMLR
2006
89views more  JMLR 2006»
13 years 7 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