Evolutionary Design of Artificial Neural Networks
Andrea Tettamanzi () and
Marco Tomassini ()
Additional contact information
Andrea Tettamanzi: University of Milan, Information Technology Department
Marco Tomassini: University of Lausanne, Computer Science Institute
Chapter Chapter 4 in Soft Computing, 2001, pp 123-159 from Springer
Abstract:
Abstract WE saw in Chapter 2 that artificial neural networks are biologically-inspired computational models that have the capability of somehow “learning” or “self-organizing” to accomplish a given task. They are particularly efficient when the nature of the task is ill-defined and the input/output mapping largely unknown. However, many aspects may affect the performance of an ANN on a given problem. Among them, the most important is the structure of the neuron connections i.e., the topology of the net, the connection weights, the details of the learning rules and of the neural activation function, and the data sets to be used for learning. There are guidelines for picking or finding reasonable values for all of these network parameters but most are rules of thumb with little theoretical background and without any relationship with each other.
Keywords: Artificial Neural Network; Hide Node; Cellular Automaton; Synaptic Weight; Evolutionary Design (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-04335-6_4
Ordering information: This item can be ordered from
http://www.springer.com/9783662043356
DOI: 10.1007/978-3-662-04335-6_4
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().