The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Tuning of the structure and parameters of a neural network using an improved genetic algorithm
Open accessAbstract
This paper presents the tuning of the structure and parameters of a neural network using an improved genetic algorithm (GA). It is also shown that the improved GA performs better than the standard GA based on some benchmark test functions. A neural network with switches introduced to its links is proposed. By doing this, the proposed neural network can learn both the input-output relationships of an application and the network structure using the improved GA. The number of hidden nodes is chosen manually by increasing it from a small number until the learning performance in terms of fitness value is good enough. Application examples on sunspot forecasting and associative memory are given to show the merits of the improved GA and the proposed neural network.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Neural Networks: A Comprehensive Foundation
Haykin, S. (1998) · Cited by 30,070
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Evolutionary programming made faster
Yao, X., Liu, Y., & Lin, G. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771163 · Cited by 3,910
Evolving artificial neural networks
Yao, X. (1999) · Proceedings of the IEEE · doi:10.1109/5.784219 · Cited by 2,981
Srinivas, M., & Patnaik, L. M. (1994) · Computer · doi:10.1109/2.294849 · Cited by 2,180
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1994) · Springer eBooks · doi:10.1007/978-3-662-07418-3 · Cited by 2,158
An Analysis Of The Behavior Of A Class Of Genetic Adaptive Systems.
Jong, K. A. D. (1975) · Deep Blue (University of Michigan) · doi:10.7302/10966 · Cited by 1,290
An evolutionary algorithm that constructs recurrent neural networks
Angeline, P. J., Saunders, G. M., & Pollack, J. B. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.265960 · Cited by 1,012
A new evolutionary system for evolving artificial neural networks
Yao, X., & Liu, Y. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572107 · Cited by 874
Cited by
Metaheuristic design of feedforward neural networks: A review of two decades of research
Ojha, V. K., Abraham, A., & Snášel, V. (2017) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2017.01.013 · Cited by 606
Huang, D.-S., & Du, J.-X. (2008) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2004370 · Cited by 393
Let a biogeography-based optimizer train your Multi-Layer Perceptron
Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014) · Information Sciences · doi:10.1016/j.ins.2014.01.038 · Cited by 329
A review on weight initialization strategies for neural networks
Narkhede, M. V., Bartakke, P. P., & Sutaone, M. S. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10033-z · Cited by 311
Condition Monitoring and Fault Diagnosis of Induction Motors: A Review
Choudhary, A., Goyal, D., Shimi, S. L., & Akula, A. (2019) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-018-9286-z · Cited by 302
Kaveh, M., & Mesgari, M. S. (2023) · Neural Processing Letters · doi:10.1007/s11063-022-11055-6 · Cited by 292
A 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
Yu, P., Low, M. Y., & Zhou, W. (2018) · Food Research International · doi:10.1016/j.foodres.2017.10.015 · Cited by 54
Automating Analogue AI Chip Design with Genetic Search
Krestinskaya, O., Salama, K. N., & James, A. P. (2020) · Advanced Intelligent Systems · doi:10.1002/aisy.202000075 · Cited by 14
Metadata
- Authors
- Leung, F. H. F., Lam, H. K., Ling, S. H., & Tam, P. K. S.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2003-01
- Volume
- 14
- Issue
- 1
- Pages
- 79-88
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2108604074
- Cited by
- 784
- References
- 26
- FWCI
- 27.21
- Type
- journal article
- Language
- en
- Open access
- green
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.