Niching methods for genetic algorithms
Niching methods for genetic algorithms
Efficiently representing populations in genetic programming
Advances in genetic programming
Structure Fitness Sharing (SFS) For Evolutionary Design By Genetic Programming
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Maintaining the Diversity of Genetic Programs
EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Machine learning in DNA microarray analysis for cancer classification
APBC '03 Proceedings of the First Asia-Pacific bioinformatics conference on Bioinformatics 2003 - Volume 19
Using group selection to evolve leadership in populations of self-replicating digital organisms
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Cooperative network construction using digital germlines
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
This paper describes the development of an evolutionary algorithm called Multipopulation Cooperative Coevolutionary Programming (MCCP) that extends Genetic Programming (GP) to search for a set of maximally different solutions for program induction problems. The GP search is structured to generate a set of alternatives that are similar in design performance, but are dissimilar from each other in the solution (or design parameter) space. This is expected to yield potentially more creative designs, thus enhancing design innovation. Application of MCCP is demonstrated through an illustrative example involving GP-based classification of genetic data to diagnose malignancy in cancer. Four different classifiers, based on highly dissimilar combinations of genes, but with similar prediction performances were generated. As these classifiers use a diverse set of genes, they are collectively more effective in screening cancer samples that may not all properly express every gene.