z-logo
Premium
Evolving modular networks with genetic algorithms: application to nonlinear time series
Author(s) -
Cofiño A.S.,
Gutiérrez J.M.,
Ivanissevich M.L.
Publication year - 2004
Publication title -
expert systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.365
H-Index - 38
eISSN - 1468-0394
pISSN - 0266-4720
DOI - 10.1111/j.1468-0394.2004.00278.x
Subject(s) - computer science , modular design , benchmark (surveying) , series (stratigraphy) , key (lock) , nonlinear system , artificial neural network , domain (mathematical analysis) , algorithm , feedforward neural network , network topology , artificial intelligence , topology (electrical circuits) , mathematics , paleontology , mathematical analysis , physics , computer security , geodesy , quantum mechanics , combinatorics , biology , geography , operating system
A key problem of modular neural networks is finding the optimal aggregation of the different subtasks (or modules) of the problem at hand. Functional networks provide a partial solution to this problem, since the inter‐module topology is obtained from domain knowledge (functional relationships and symmetries). However, the learning process may be too restrictive in some situations, since the resulting modules (functional units) are assumed to be linear combinations of selected families of functions. In this paper, we present a non‐parametric learning approach for functional networks using feedforward neural networks for approximating the functional modules of the resulting architecture; we also introduce a genetic algorithm for finding the optimal intra‐module topology (the appropriate balance of neurons for the different modules according to the complexity of their respective tasks). Some benchmark examples from nonlinear time‐series prediction are used to illustrate the performance of the algorithm for finding optimal modular network architectures for specific problems.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here