Sciweavers

227 search results - page 13 / 46
» A PAC Bound for Approximate Support Vector Machines
Sort
View
ICML
2004
IEEE
14 years 8 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
ML
2002
ACM
146views Machine Learning» more  ML 2002»
13 years 7 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio
IJCNN
2006
IEEE
14 years 1 months ago
Pattern Selection for Support Vector Regression based on Sparseness and Variability
— Support Vector Machine has been well received in machine learning community with its theoretical as well as practical value. However, since its training time complexity is cubi...
Jiyoung Sun, Sungzoon Cho
IJCAI
2003
13 years 8 months ago
Approximate Policy Iteration using Large-Margin Classifiers
We present an approximate policy iteration algorithm that uses rollouts to estimate the value of each action under a given policy in a subset of states and a classifier to general...
Michail G. Lagoudakis, Ronald Parr