Research Repository

Memory with memory in tree-based genetic programming

Poli, R and McPhee, NF and Citi, L and Crane, E (2009) Memory with memory in tree-based genetic programming. In: UNSPECIFIED, ? - ?.

Full text not available from this repository.

Abstract

In recent work on linear register-based genetic programming (GP) we introduced the notion ofMemory-with-Memory (MwM), where the results of operations are stored in registers using a form of soft assignment which blends a result into the current content of a register rather than entirely replace it. The MwM system yielded very promising results on a set of symbolic regression problems. In this paper, we propose a way of introducing MwM style behaviour in treebased GP systems. The technique requires only very minor modifications to existing code, and, therefore, is easy to apply. Experiments on a variety of synthetic and real-world problems show that MwM is very beneficial in tree-based GP, too.©Springer-Verlag Berlin Heidelberg 2009.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Additional Information: Published proceedings: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Jim Jamieson
Date Deposited: 06 Mar 2014 10:04
Last Modified: 05 Feb 2019 19:15
URI: http://repository.essex.ac.uk/id/eprint/8822

Actions (login required)

View Item View Item