2898 search results - page 338 / 580 » Ensemble Methods in Machine Learning |
192
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...
159
click to vote
ICML
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with assoc...
177
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
180
click to vote
COLT
1998
Springer
15 years 10 months ago
1998
Springer
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like...
156
click to vote
ECML
1998
Springer
15 years 10 months ago
1998
Springer
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...