64 search results - page 3 / 13 » Out-of-bag estimation of the optimal sample size in bagging |
COMPGEOM
2003
ACM
14 years 29 days ago
2003
ACM
In this paper we describe and analyze a method based on local least square fitting for estimating the normals at all sample points of a point cloud data (PCD) set, in the presenc...
SLS
2009
Springer
14 years 2 months ago
2009
Springer
Stochastic local search algorithms can now successfully solve MAXSAT problems with thousands of variables or more. A key to this success is how effectively the search can navigate...
PODS
1999
ACM
14 years 1 days ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
SIAMJO
2008
13 years 7 months ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The usual approach to deal with noise present in many realworld optimization problems is to take an arbitrary number of samples of the objective function and use the samp...