Location Independent Pattern Recognition using Genetic
Programming
M. Breunig. Genetic Algorithms and Genetic Programming at Stanford
1995, Stanford Bookstore, Stanford, California, 94305-3079 USA, (11 December 1995)
Abstract
This paper describes an application of genetic
programming. Programs able of recognising a pattern
independent of its location are evolved. Usually the
evolution of programs is controlled primarily by the
fitness evaluation function. This paper demonstrates
how genetic programming can be encouraged to evolve
programs with properties not being explicitly
considered in the fitness measure like location
independence. The measurements taken include the use of
automatically defined functions allowing the problem to
be decomposed into sub-functions, a special
implementation of iteration and carefully chosen
function and terminal sets. A main purpose was to
minimise the restrictions imposed on the solution, i.e.
giving the genetic programming as much freedom as
possible while still encouraging the desired
properties.
%0 Book Section
%1 breunig:1995:LIPRGP
%A Breunig, Markus M.
%B Genetic Algorithms and Genetic Programming at Stanford
1995
%C Stanford, California, 94305-3079 USA
%D 1995
%E Koza, John R.
%I Stanford Bookstore
%K ADF algorithms, genetic programming,
%P 29--38
%T Location Independent Pattern Recognition using Genetic
Programming
%U http://www.dbs.informatik.uni-muenchen.de/~breunig/HomepageResearch/Papers/PatternRecog.pdf
%X This paper describes an application of genetic
programming. Programs able of recognising a pattern
independent of its location are evolved. Usually the
evolution of programs is controlled primarily by the
fitness evaluation function. This paper demonstrates
how genetic programming can be encouraged to evolve
programs with properties not being explicitly
considered in the fitness measure like location
independence. The measurements taken include the use of
automatically defined functions allowing the problem to
be decomposed into sub-functions, a special
implementation of iteration and carefully chosen
function and terminal sets. A main purpose was to
minimise the restrictions imposed on the solution, i.e.
giving the genetic programming as much freedom as
possible while still encouraging the desired
properties.
%@ 0-18-195720-5
@incollection{breunig:1995:LIPRGP,
abstract = {This paper describes an application of genetic
programming. Programs able of recognising a pattern
independent of its location are evolved. Usually the
evolution of programs is controlled primarily by the
fitness evaluation function. This paper demonstrates
how genetic programming can be encouraged to evolve
programs with properties not being explicitly
considered in the fitness measure like location
independence. The measurements taken include the use of
automatically defined functions allowing the problem to
be decomposed into sub-functions, a special
implementation of iteration and carefully chosen
function and terminal sets. A main purpose was to
minimise the restrictions imposed on the solution, i.e.
giving the genetic programming as much freedom as
possible while still encouraging the desired
properties.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Stanford, California, 94305-3079 USA},
author = {Breunig, Markus M.},
biburl = {https://www.bibsonomy.org/bibtex/25aed5b45b35d97ce4c7e58c6b5bd37e4/brazovayeye},
booktitle = {Genetic Algorithms and Genetic Programming at Stanford
1995},
editor = {Koza, John R.},
interhash = {79ecd9f8a20543ea734ad70590cf12ef},
intrahash = {5aed5b45b35d97ce4c7e58c6b5bd37e4},
isbn = {0-18-195720-5},
keywords = {ADF algorithms, genetic programming,},
month = {11 December},
notes = {part of \cite{koza:1995:gagp}},
pages = {29--38},
publisher = {Stanford Bookstore},
size = {10 pages},
timestamp = {2008-06-19T17:36:56.000+0200},
title = {Location Independent Pattern Recognition using Genetic
Programming},
url = {http://www.dbs.informatik.uni-muenchen.de/~breunig/HomepageResearch/Papers/PatternRecog.pdf},
year = 1995
}