All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Genetic Programming of Augmenting Topologies for Hypercube-Based Indirect Encoding of Artificial Neural Networks

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F13%3A00195551" target="_blank" >RIV/68407700:21230/13:00195551 - isvavai.cz</a>

  • Result on the web

    <a href="http://rd.springer.com/chapter/10.1007/978-3-642-32922-7_7" target="_blank" >http://rd.springer.com/chapter/10.1007/978-3-642-32922-7_7</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-642-32922-7_7" target="_blank" >10.1007/978-3-642-32922-7_7</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Genetic Programming of Augmenting Topologies for Hypercube-Based Indirect Encoding of Artificial Neural Networks

  • Original language description

    In this paper we present a novel algorithm called GPAT (Genetic Programming of Augmenting Topologies) which evolves Genetic Programming (GP) trees in a similar way as a well-established neuro-evolutionary algorithm NEAT (NeuroEvolution of Augmenting Topologies) does. The evolution starts from a minimal form and gradually adds structure as needed. A niching evolutionary algorithm is used to protect individuals of a variable complexity in a single population. Although GPAT is a general approach we employit mainly to evolve artificial neural networks by means of Hypercube-based indirect encoding which is an approach allowing for evolution of large-scale neural networks having theoretically unlimited size. We perform also experiments for directly encodedproblems. The results show that GPAT outperforms both GP and NEAT taking the best of both.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2013

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Soft Computing Models in Industrial and Environmental Applications

  • ISBN

    978-3-642-32921-0

  • ISSN

    2194-5357

  • e-ISSN

  • Number of pages

    10

  • Pages from-to

    63-72

  • Publisher name

    Springer

  • Place of publication

    Heidelberg

  • Event location

    Ostrava

  • Event date

    Sep 5, 2012

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article

    000312974600007