Letter Recognition Using Holland-Style Adaptive Classifiers
Machine Learning
Recombination, selection, and the genetic construction of computer programs
Recombination, selection, and the genetic construction of computer programs
Limiting the Number of Fitness Cases in Genetic Programming Using Statistics
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
The Fast Evaluation Strategy for Evolvable Hardware
Genetic Programming and Evolvable Machines
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Diversity control in GP with ADF for regression tasks
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Another investigation on tournament selection: modelling and visualisation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A survey and taxonomy of performance improvement of canonical genetic programming
Knowledge and Information Systems
An effective intelligent algorithm for stochastic optimization problem
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
A review of tournament selection in genetic programming
ISICA'10 Proceedings of the 5th international conference on Advances in computation and intelligence
Bottom-Up tree evaluation in tree-based genetic programming
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Hi-index | 0.00 |
This paper proposes an approach to reducing the cost of fitness evaluation whilst improving the effectiveness in Genetic Programming (GP). In our approach, the whole population is first clustered by a heuristic called fitness-case-equivalence. Then a cluster representative is selected for each cluster. The fitness value of the representative is calculated on all training cases. The fitness is then directly assigned to other members in the same cluster. Subsequently, a clustering tournament selection method replaces the standard tournament selection method. A series of experiments were conducted to solve a symbolic regression problem, a binary classification problem, and a multi-class classification problem. The experiment results show that the new GP system significantly outperforms the standard GP system on these problems.