Evolutive Introns: A Non-Costly Method of Using Introns in GP

Authors:
Santiago García Carbajal;Fermín González Martinez
Affiliations:
Departamento de Informática, Universidad de Oviedo, Spain carbajal@lsi.uniovi.es;Departamento de Informática, Universidad de Oviedo, Spain fermingm@lsi.uniovi.es
Venue:
Genetic Programming and Evolvable Machines
Year:
2001

Citing 16
Cited 7

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
The evolution of evolvability in genetic programming

Advances in genetic programming
Genetic programming and emergent intelligence

Advances in genetic programming
Two self-adaptive crossover operators for genetic programming

Advances in genetic programming
Explicitly defined introns and destructive crossover in genetic programming

Advances in genetic programming
The GA-P: A Genetic Algorithm and Genetic Programming Hybrid

IEEE Expert: Intelligent Systems and Their Applications
Complexity Compression and Evolution

Proceedings of the 6th International Conference on Genetic Algorithms
A Survey of Intron Research in Genetics

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Evolving Compact Solutions in Genetic Programming: A Case Study

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Introns in Nature and in Simulated Structure Evolution

Biocomputing and emergent computation: Proceedings of BCEC97
Empirical studies of the genetic algorithm with noncoding segments

Evolutionary Computation
A comparison of the fixed and floating building block representation in the genetic algorithm

Evolutionary Computation
A study in program response and the negative effects of introns in genetic programming

GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
An investigation into the sensitivity of genetic programming to the frequency of leaf selection during subtree crossover

GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
The benefits of computing with introns

GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Testing the robustness of the genetic algorithm on the floating building block representation

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Dormant program nodes and the efficiency of genetic programming

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Eliminating Introns in Ant Colony Programming

Fundamenta Informaticae
A survey and taxonomy of performance improvement of canonical genetic programming

Knowledge and Information Systems
The identification and exploitation of dormancy in genetic programming

Genetic Programming and Evolvable Machines
Multi Niche parallel GP with a junk-code migration model

EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Comparison of the effectiveness of decimation and automatically defined functions

KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
Eliminating Introns in Ant Colony Programming

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We proposed a new strategy to explicitly define introns that increases the probability of selecting good crossover points as evolution goes on. Our approach differs from existing methods in the procedure followed to adapt the probabilities of groups of code being protected. We also provide some experimental results in symbolic regression and classification that reinforced our belief in the usefulness of this procedure. Collateral effects of Evolutive Introns (EIs) are also studied to determine possible modifications in the behavior of a classical Genetic Programming (GP) system.