1060 search results - page 167 / 212 » On the Discovery of Random Trees |
80
Voted
CAEPIA
2003
Springer
15 years 3 months ago
2003
Springer
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...
119
click to vote
COLT
2001
Springer
15 years 2 months ago
2001
Springer
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...
ICML
2000
IEEE
15 years 2 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...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
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...
SGP
2004
15 years 15 days ago
2004
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...