Automatic task decomposition for the neuroevolution of augmenting topologies (NEAT) algorithm

4Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Neuroevolution, the process of creating artificial neural networks through simulated evolution, can become impractical for arbitrarily complex problems requiring large or intricate neural network architectures. The modular feed forward neural network (MFFN) architecture decomposes a problem among a number of independent task specific neural networks, and is suggested here as a means of managing neuroevolution for complex problems. We present an algorithm for evolving MFFN architectures based on the NeuroEvolution of Augmenting Topologies (NEAT) algorithm. The algorithm proposed here, denoted MFF-NEAT, outlines an approach to automatically evolving, attributing fitness values and combining the task specific networks in a principled manner. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Manning, T., & Walsh, P. (2012). Automatic task decomposition for the neuroevolution of augmenting topologies (NEAT) algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7246 LNCS, pp. 1–12). https://doi.org/10.1007/978-3-642-29066-4_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free