Sciweavers

1021 search results - page 7 / 205
» Model selection in genetic programming
Sort
View
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 1 months ago
An analysis of constructive crossover and selection pressure in genetic programming
A common problem in genetic programming search algorithms is destructive crossover in which the offspring of good parents generally has worse performance than the parents. Design...
Huayang Xie, Mengjie Zhang, Peter Andreae
AISB
1997
Springer
13 years 11 months ago
Modelling Bounded Rationality Using Evolutionary Techniques
A technique for the credible modelling of economic agents with bounded rationality based on the evolutionary techniques is described. The genetic programming paradigm is most suite...
Bruce Edmonds, Scott Moss
CORR
2006
Springer
130views Education» more  CORR 2006»
13 years 7 months ago
Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
Christian Gagné, Marc Schoenauer, Mich&egra...
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
13 years 11 months ago
Hybrid search for cardinality constrained portfolio optimization
In this paper, we describe how a genetic algorithm approach added to a simulated annealing (SA) process offers a better alternative to find the mean variance frontier in the portf...
Miguel A. Gomez, Carmen X. Flores, Maria A. Osorio
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
13 years 8 months ago
An analysis of multi-sampled issue and no-replacement tournament selection
Standard tournament selection samples individuals with replacement. The sampling-with-replacement strategy has its advantages but also has issues. One of the commonly recognised i...
Huayang Xie, Mengjie Zhang, Peter Andreae, Mark Jo...