701 search results - page 81 / 141 » Self Bounding Learning Algorithms |
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We describe and analyze efficient algorithms for learning a linear predictor from examples when the learner can only view a few attributes of each training example. This is the ca...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
We present a new generalization bound where the use of unlabeled examples results in a better ratio between training-set size and the resulting classifier’s quality and thus red...
APN
2010
Springer
13 years 5 months ago
2010
Springer
Workflow mining is the task of automatically producing a workflow model from a set of event logs recording sequences of workflow events; each sequence corresponds to a use case or ...
COLT
1997
Springer
13 years 12 months ago
1997
Springer
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...