1993
DOI: 10.1007/3-540-56798-4_145
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of a competitive learning neural network by genetic algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
14
0

Year Published

2003
2003
2013
2013

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 22 publications
(14 citation statements)
references
References 4 publications
0
14
0
Order By: Relevance
“…This may lead to poor predicting accuracy and unstable forecast performance. However, this can be partly overcome by applying genetic algorithm optimization methods [55] and/or particle swarm optimization [56] algorithm.…”
Section: Discussionmentioning
confidence: 99%
“…This may lead to poor predicting accuracy and unstable forecast performance. However, this can be partly overcome by applying genetic algorithm optimization methods [55] and/or particle swarm optimization [56] algorithm.…”
Section: Discussionmentioning
confidence: 99%
“…When a genetic operator changes an MLP, it considers each hidden neuron (and its input and output weights) as a gene, so that if two MLPs are crossed, complete hidden layer neurons are interchanged (and weights to and from it are treated as one unit) [43], [44], [45].…”
Section: The Methodsmentioning
confidence: 99%
“…When a genetic operator changes a MLP, it considers each hidden neuron (and its input and output weights) as a "gene", so that if two MLPs are crossed, complete hidden layer neurons are interchanged (and weights to and from it are treated as one unit), as proposed in [25,31].…”
Section: Gprop Methodsmentioning
confidence: 99%
“…ral net [34]. Several authors have suggested evolving ANNs by coding the weights and learning parameters of the individuals of an evolutionary algorithm (EA), pre-establishing the number of neurons and the connectivity between them [21,25]. However, these representations can lead to a lack of precision by restricting the search to just an area of the possible space.…”
Section: Introductionmentioning
confidence: 99%