[Seeding Methods for Run Transferable Libraries] Capturing Domain Relevant Functionality through Schematic Manipulation for Genetic Programming

@article{Murphy2007SeedingMF,
  title={[Seeding Methods for Run Transferable Libraries] Capturing Domain Relevant Functionality through Schematic Manipulation for Genetic Programming},
  author={Gearoid Murphy and Conor Ryan and Daniel Howard},
  journal={2007 Frontiers in the Convergence of Bioscience and Information Technologies},
  year={2007},
  pages={769-772}
}
This paper applies a recently developed technique of expression structure analysis and parametric distribution to the generation of functional content relevant to the problem domain. This functional basis set will then be iteratively sampled by a GP system as part of the Run Transferable Libraries process. We introduce a new algorithm for adapting the schematic templates discovered by such an analysis into a family of related functional expressions, differentiated by the number of arguments to… 
View on IEEE
doi.ieeecomputersociety.org
4 Citations
Background Citations
2
Methods Citations
1

Figures from this paper

4 Citations

Citation Type

Citation Type

A Simple Approach to Lifetime Learning in Genetic Programming-Based Symbolic Regression
TLDR
The Chameleon system is introduced to augment GP with lifetime learning by adding a simple local search that operates by tuning the internal nodes of individuals, and uses available genetic material more efficiently by exploring more actively than with standard GP.
Transfer learning in constructive induction with Genetic Programming
TLDR
This work studies the performance of transferred solutions when the source and target tasks are from different domains, and when they do not share a similar input feature space, and shows that it is possible to predict the success of TL in some cases, particularly in classification tasks.
Mendelian and Non-Mendelian Ancestral Repair for Constrained Evolutionary Optimisation
TLDR
This thesis adapts this novel genetic repair strategy to an EA to solve two benchmark constraint based problems specifically permutation problems as this category of problem are often recognised as the most problematic problems for the canonical EA to deal with and shows that under biologically inspired conditions, the non-Mendelian repair strategy continues to outperform its Mendelian counterpart.
Genetic programming based predictions and estimations for the endurance and retention of NAND flash memory devices
TLDR
The central hypothesis of this thesis is that it is possible to use a supervised machine learning technique, Genetic Programming (GP), to make accurate predictions and estimations regarding the endurance and retention of multi-level cell NAND Flash Memory devices.

References

SHOWING 1-4 OF 4 REFERENCES
Hierarchical Self-Organization in Genetic programming
Run Transferable Libraries - Learning Functional Bias in Problem Domains
TLDR
It is demonstrated that a system using Run Transferable Libraries can solve a selection of standard benchmarks considerably more quickly than GP with ADFs by building knowledge about a problem.
The Evolutionary Induction of Subroutines
TLDR
A genetic algorithm capable of evolving large programs is described by exploiting two new genetic operators which construct and deconstruct parameterized subroutines which help to solve the scaling problem for a class of genetic problem solving methods.
Evolving Modules in Genetic Programming by Subtree Encapsulation
TLDR
This paper investigates the effect of encapsulating tree-based genetic programming subtrees by representing them as atoms in the terminal set, so that the subtree evaluations can be exploited as terminal data.