2190 search results - page 100 / 438 » Learning with the Set Covering Machine |
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
ALT
2004
Springer
14 years 6 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
ICML
2008
IEEE
14 years 10 months ago
2008
IEEE
We describe an algorithm for learning in the presence of multiple criteria. Our technique generalizes previous approaches in that it can learn optimal policies for all linear pref...
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
Recently there has been considerable interest in learning with higher order relations (i.e., three-way or higher) in the unsupervised and semi-supervised settings. Hypergraphs and...
SSPR
2004
Springer
14 years 2 months ago
2004
Springer
Most machine learning algorithms are designed either for supervised or for unsupervised learning, notably classification and clustering. Practical problems in bioinformatics and i...