4208 search results - page 38 / 842 » Better Selection of the Best |
ICMLA
2008
14 years 12 days ago
2008
Using decision trees that split on randomly selected attributes is one way to increase the diversity within an ensemble of decision trees. Another approach increases diversity by ...
PPOPP
2012
ACM
12 years 6 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
IUI
2006
ACM
14 years 5 months ago
2006
ACM
Recent interest in the use of software character agents raises the issue of how many agents should be used in online learning. In this paper we review evidence concerning the rela...
COLT
2006
Springer
14 years 2 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
EMNLP
2006
14 years 11 days ago
2006
We study unsupervised methods for learning refinements of the nonterminals in a treebank. Following Matsuzaki et al. (2005) and Prescher (2005), we may for example split NP withou...