1996
DOI: 10.1109/72.508930
|View full text |Cite
|
Sign up to set email alerts
|

Cooperative-competitive genetic evolution of radial basis function centers and widths for time series prediction

Abstract: In a radial basis function (RBF) network, the RBF centers and widths can be evolved by a cooperative-competitive genetic algorithm. The set of genetic strings in one generation of the algorithm represents one REP network, not a population of competing networks. This leads to moderate computation times for the algorithm as a whole. Selection operates on individual RBFs rather than on whole networks. Selection therefore requires a genetic fitness function that promotes competition among RBFs which are doing near… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
76
0

Year Published

1999
1999
2017
2017

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 208 publications
(76 citation statements)
references
References 53 publications
(4 reference statements)
0
76
0
Order By: Relevance
“…The Mackey Glass time series prediction. This time series is widely regarded as a benchmark for comparing the general ization ability of RBNN [9,17,7,16]. It is a chaotic time series created by the Mackey Glass delay difference equation [6]:…”
Section: Domains Descriptionmentioning
confidence: 99%
“…The Mackey Glass time series prediction. This time series is widely regarded as a benchmark for comparing the general ization ability of RBNN [9,17,7,16]. It is a chaotic time series created by the Mackey Glass delay difference equation [6]:…”
Section: Domains Descriptionmentioning
confidence: 99%
“…where α = 0.2, β = −0.1, τ = 17 as used in [7,8,[13][14][15]. Each network receives four past data points x(t), x(t − 6), x(t − 12) and x(t − 18) as inputs and predicts 6 time steps ahead (x(t + 6)).…”
Section: Mackey-glass Time Series Prediction Problemmentioning
confidence: 99%
“…As discussed in [7], while evolving a single network we should have β ∈ (1, 2) to encourage the desired behaviour of competition and cooperation among RBGFs with similar and different functionalities, respectively. Also, β = 2.0 produces too much of competition and β = 1.0 is insufficient to prevent competition among RBGFs with dissimilar activations, while β = 1.5 yields the desired behavior.…”
Section: Weights-based Credit Assignmentmentioning
confidence: 99%
See 1 more Smart Citation
“…The overall efficiency of RBFNs has been proved in many areas such as pattern classification [6], function approximation [18] or time series prediction [25]. Typically these networks are design by means of evolutionary algorithms [11].…”
Section: Introductionmentioning
confidence: 99%