Competition and Collaboration in Cooperative Coevolution of Elman Recurrent Neural Networks for Time-Series Prediction
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Collaboration enables weak species to survive in an environment where different species compete for limited resources. Cooperative coevolution (CC) is a nature-inspired optimization method that divides a problem into subcomponents and evolves them while genetically isolating them. Problem decomposition is an important aspect in using CC for neuroevolution. CC employs different problem decomposition methods to decompose the neural network training problem into subcomponents. Different problem decomposition methods have features that are helpful at different stages in the evolutionary process. Adaptation, collaboration, and competition are needed for CC, as multiple subpopulations are used to represent the problem. It is important to add collaboration and competition in CC. This paper presents a competitive CC method for training recurrent neural networks for chaotic time-series prediction. Two different instances of the competitive method are proposed that employs different problem decomposition methods to enforce island-based competition. The results show improvement in the performance of the proposed methods in most cases when compared with standalone CC and other methods from the literature.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elman, J. L. (1990) · Cognitive Science · doi:10.1207/s15516709cog1402_1 · Cited by 11,212
Detecting strange attractors in turbulence
Takens, F. (1981) · Lecture Notes in Mathematics · doi:10.1007/bfb0091924 · Cited by 10,459
Cited by
A Review of Deep Learning Models for Time Series Prediction
Han, Z., Zhao, J., Leung, H., Ma, K. F., & Wang, W. (2021) · IEEE Sensors Journal · doi:10.1109/jsen.2019.2923982 · Cited by 501
CNN-RNN Based Intelligent Recommendation for Online Medical Pre-Diagnosis Support
Zhou, X., Li, Y., & Liang, W. (2021) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2020.2994780 · Cited by 455
Wu, J., Hu, K., Cheng, Y., Zhu, H., Shao, X., & Wang, Y. (2020) · ISA Transactions · doi:10.1016/j.isatra.2019.07.004 · Cited by 349
A Survey on Cooperative Co-Evolutionary Algorithms
Ma, X., Li, X., Zhang, Q., Tang, K., Liang, Z., Xie, W., & Zhu, Z. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2018.2868770 · Cited by 336
Wind speed forecasting approach using secondary decomposition algorithm and Elman neural networks
Liu, H., Tian, H.-Q., Liang, X.-F., & Li, Y.-F. (2015) · Applied Energy · doi:10.1016/j.apenergy.2015.08.014 · Cited by 287
Evaluation of Deep Learning Models for Multi-Step Ahead Time Series Prediction
Chandra, R., Goyal, S., & Gupta, R. (2021) · IEEE Access · doi:10.1109/access.2021.3085085 · Cited by 265
Self-citationA survey of swarm and evolutionary computing approaches for deep learning
Darwish, A., Hassanien, A. E., & Das, S. (2020) · Artificial Intelligence Review · doi:10.1007/s10462-019-09719-2 · Cited by 200
“Some other recent and notable approaches of using EC methods for optimization of non-deep neural architectures can be found in works like Tan et al. (2015), Wang et al. (2017), Chandra (2015) and Liu et al. (2016).”
Method
Metadata
- Authors
- Chandra, R.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2015-12
- Volume
- 26
- Issue
- 12
- Pages
- 3123-3136
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2133573607
- Cited by
- 162
- References
- 2
- FWCI
- 17.20
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.