1435 search results - page 19 / 287 » Generalization Error Bounds Using Unlabeled Data |
JACM
2000
13 years 8 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
COLT
1998
Springer
14 years 20 days ago
1998
Springer
Most of the work which attempts to give bounds on the generalization error of the hypothesis generated by a learning algorithm is based on methods from the theory of uniform conve...
COLING
2008
13 years 10 months ago
2008
We present the first results on parsing the SYNTAGRUS treebank of Russian with a data-driven dependency parser, achieving a labeled attachment score of over 82% and an unlabeled a...
IDEAL
2007
Springer
14 years 2 months ago
2007
Springer
The dependence of the classification error on the size of a bagging ensemble can be modeled within the framework of Monte Carlo theory for ensemble learning. These error curves ar...
COLT
2007
Springer
14 years 2 months ago
2007
Springer
We describe and analyze a new approach for feature ranking in the presence of categorical features with a large number of possible values. It is shown that popular ranking criteria...