Sciweavers

9888 search results - page 88 / 1978
» Active Algorithm Selection
Sort
View
NIPS
2004
13 years 11 months ago
Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
GECCO
2005
Springer
113views Optimization» more  GECCO 2005»
14 years 3 months ago
Estimating the detector coverage in a negative selection algorithm
This paper proposes a statistical mechanism to analyze the detector coverage in a negative selection algorithm, namely a quantitative measurement of a detector set’s capability ...
Zhou Ji, Dipankar Dasgupta
GECCO
2003
Springer
14 years 3 months ago
Selection Intensity in Asynchronous Cellular Evolutionary Algorithms
Abstract. This paper presents a theoretical study of the selection pressure in asynchronous cellular evolutionary algorithms (cEAs). This work is motivated by the search for a gene...
Mario Giacobini, Enrique Alba, Marco Tomassini
PR
2008
131views more  PR 2008»
13 years 10 months ago
A memetic algorithm for evolutionary prototype selection: A scaling up approach
Prototype selection problem consists of reducing the size of databases by removing samples that are considered noisy or not influential on nearest neighbour classification tasks. ...
Salvador García, José Ramón C...
CP
2011
Springer
12 years 10 months ago
Algorithm Selection and Scheduling
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, ...