Sciweavers

GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
13 years 11 months ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
13 years 11 months ago
Kernel based automatic clustering using modified particle swarm optimization algorithm
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...
Ajith Abraham, Swagatam Das, Amit Konar
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
13 years 11 months ago
Towards clustering with XCS
This paper presents a novel approach to clustering using an accuracy-based Learning Classifier System. Our approach achieves this by exploiting the generalization mechanisms inher...
Kreangsak Tamee, Larry Bull, Ouen Pinngern
GECCO
2007
Springer
186views Optimization» more  GECCO 2007»
13 years 11 months ago
A multi-objective approach for the prediction of loan defaults
Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made...
Oluwarotimi Odeh, Praveen Koduru, Sanjoy Das, Alle...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
13 years 11 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
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
13 years 11 months ago
Informative performance metrics for dynamic optimisation problems
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
Stefan Bird, Xiaodong Li
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
13 years 11 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
13 years 11 months ago
Two adaptive mutation operators for optima tracking in dynamic optimization problems with evolution strategies
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
Claudio Rossi, Antonio Barrientos, Jaime del Cerro
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
13 years 11 months ago
Heuristic speciation for evolving neural network ensemble
Speciation is an important concept in evolutionary computation. It refers to an enhancements of evolutionary algorithms to generate a set of diverse solutions. The concept is stud...
Shin Ando