1149 search results - page 74 / 230 » Comparing parameter tuning methods for evolutionary algorith... |
105
Voted
NICSO
2010
Springer
15 years 4 months ago
2010
Springer
t] Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for comple...
91
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Many evolutionary computation search spaces require fitness assessment through the sampling of and generalization over a large set of possible cases as input. Such spaces seem par...
101
click to vote
BMCBI
2008
15 years 22 days ago
2008
Background: Choosing the appropriate sample size is an important step in the design of a microarray experiment, and recently methods have been proposed that estimate sample sizes ...
83
Voted
IJCNN
2006
IEEE
15 years 6 months ago
2006
IEEE
— We propose a new annealing method for the hyperparameters of several recent Learning Vector Quantization algorithms. We first analyze the relationship between values assigned ...
88
Voted
ICPR
2002
IEEE
16 years 1 months ago
2002
IEEE
In this paper, we address the problem of semisupervision in the framework of parametric clustering by using labeled and unlabeled data together. Clustering algorithms can take adv...