Sciweavers

3055 search results - page 50 / 611
» Randomized Search Trees
Sort
View
IJCAI
1993
13 years 10 months ago
Induction of Oblique Decision Trees
This article describes a new system for induction of oblique decision trees. This system, OC1, combines deterministic hill-climbing with two forms of randomization to nd a good ob...
David G. Heath, Simon Kasif, Steven Salzberg
JMLR
2012
11 years 11 months ago
Random Search for Hyper-Parameter Optimization
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
James Bergstra, Yoshua Bengio
CN
1999
73views more  CN 1999»
13 years 8 months ago
Measuring Index Quality Using Random Walks on the Web
Recent researchhas studied howto measurethe size of a searchengine, in terms of the number of pages indexed. In this paper, we consider a di erent measure for search engines, name...
Monika Rauch Henzinger, Allan Heydon, Michael Mitz...
COMBINATORICS
2006
129views more  COMBINATORICS 2006»
13 years 9 months ago
Descendants in Increasing Trees
Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i. e. labellin...
Markus Kuba, Alois Panholzer
ISITA
2010
13 years 7 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...