Sciweavers

1068 search results - page 164 / 214
» Extremely randomized trees
Sort
View
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
14 years 3 months ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick
CAEPIA
2003
Springer
14 years 3 months ago
Rotation-Based Ensembles
A new method for ensemble generation is presented. It is based on grouping the attributes in dierent subgroups, and to apply, for each group, an axis rotation, using Principal Com...
Juan José Rodríguez, Carlos J. Alons...
COLT
2001
Springer
14 years 2 months ago
Agnostic Boosting
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
Shai Ben-David, Philip M. Long, Yishay Mansour
ICML
2000
IEEE
14 years 2 months ago
Discriminative Reranking for Natural Language Parsing
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...
Michael Collins
ECML
2006
Springer
14 years 1 months ago
Improving Control-Knowledge Acquisition for Planning by Active Learning
Automatically acquiring control-knowledge for planning, as it is the case for Machine Learning in general, strongly depends on the training examples. In the case of planning, examp...
Raquel Fuentetaja, Daniel Borrajo