Sciweavers

916 search results - page 62 / 184
» Algorithm selection: a quantitative computation-intensive op...
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
15 years 4 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
15 years 10 months ago
Growth Curves and Takeover Time in Distributed Evolutionary Algorithms
This paper presents a study of different models for the growth curves and takeover time in a distributed EA (dEA). The calculation of the takeover time and the dynamical growth cu...
Enrique Alba, Gabriel Luque
ICML
2010
IEEE
15 years 5 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag
DAGM
2004
Springer
15 years 10 months ago
Adaptive Feature Selection in Image Segmentation
Most image segmentation algorithms optimize some mathematical similarity criterion derived from several low-level image features. One possible way of combining different types of f...
Volker Roth, Tilman Lange
EMO
2006
Springer
107views Optimization» more  EMO 2006»
15 years 8 months ago
Designing Multi-objective Variation Operators Using a Predator-Prey Approach
In this paper, we propose a new conceptual method for the design, investigation, and evaluation of multi-objective variation operators for evolutionary multi-objective algorithms. ...
Christian Grimme, Joachim Lepping