70 search results - page 9 / 14 » Using Generalization Error Bounds to Train the Set Covering ... |
ML
2002
ACM
13 years 7 months ago
2002
ACM
We present a general approach to model selection and regularization that exploits unlabeled data to adaptively control hypothesis complexity in supervised learning tasks. The idea ...
COLT
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
JMLR
2010
13 years 2 months ago
2010
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
ICLP
1997
Springer
13 years 11 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
JMLR
2006
13 years 7 months ago
2006
In this paper, we propose a number of adaptive prototype learning (APL) algorithms. They employ the same algorithmic scheme to determine the number and location of prototypes, but...