Sciweavers

4903 search results - page 302 / 981
» The Set Covering Machine
Sort
View
COLT
2008
Springer
15 years 8 months ago
Regret Bounds for Sleeping Experts and Bandits
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yo...
ALT
2010
Springer
15 years 8 months ago
Towards General Algorithms for Grammatical Inference
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
Alexander Clark
ICML
2010
IEEE
15 years 4 months ago
Bayes Optimal Multilabel Classification via Probabilistic Classifier Chains
In the realm of multilabel classification (MLC), it has become an opinio communis that optimal predictive performance can only be achieved by learners that explicitly take label d...
Krzysztof Dembczynski, Weiwei Cheng, Eyke Hül...
JMLR
2011
110views more  JMLR 2011»
15 years 1 months ago
Training SVMs Without Offset
We develop, analyze, and test a training algorithm for support vector machine classifiers without offset. Key features of this algorithm are a new, statistically motivated stoppi...
Ingo Steinwart, Don R. Hush, Clint Scovel
JMLR
2010
187views more  JMLR 2010»
15 years 1 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause