Sciweavers

143 search results - page 11 / 29
» Sampling Strategies to Evaluate the Performance of Unknown P...
Sort
View
ICDE
1993
IEEE
120views Database» more  ICDE 1993»
13 years 11 months ago
Adaptable Pointer Swizzling Strategies in Object Bases
In this article, different techniques for 'pointer swizzling" are classified and evaluated for optimizing the access to main-memory resident persistent objects. To speed ...
Alfons Kemper, Donald Kossmann
ICDM
2007
IEEE
131views Data Mining» more  ICDM 2007»
13 years 11 months ago
Predicting and Optimizing Classifier Utility with the Power Law
When data collection is costly and/or takes a significant amount of time, an early prediction of the classifier performance is extremely important for the design of the data minin...
Mark Last
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
13 years 11 months ago
Benchmarking the (1, 4)-CMA-ES with mirrored sampling and sequential selection on the noisy BBOB-2010 testbed
The Covariance-Matrix-Adaptation Evolution-Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space RD . Recently, ...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
CEC
2010
IEEE
13 years 6 months ago
Gaussian Adaptation as a unifying framework for continuous black-box optimization and adaptive Monte Carlo sampling
Abstract— We present a unifying framework for continuous optimization and sampling. This framework is based on Gaussian Adaptation (GaA), a search heuristic developed in the late...
Christian L. Müller, Ivo F. Sbalzarini
TIT
1998
96views more  TIT 1998»
13 years 7 months ago
Sequential Prediction of Individual Sequences Under General Loss Functions
Abstract— We consider adaptive sequential prediction of arbitrary binary sequences when the performance is evaluated using a general loss function. The goal is to predict on each...
David Haussler, Jyrki Kivinen, Manfred K. Warmuth