The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Meta learning evolutionary artificial neural networks
Open accessAbstract
Abstract In this paper, we present meta-learning evolutionary artificial neural network (MLEANN), an automatic computational framework for the adaptive optimization of artificial neural networks (ANNs) wherein the neural network architecture, activation function, connection weights; learning algorithm and its parameters are adapted according to the problem. We explored the performance of MLEANN and conventionally designed ANNs for function approximation problems. To evaluate the comparative performance, we used three different well-known chaotic time series. We also present the state-of-the-art popular neural network learning algorithms and some experimentation results related to convergence speed and generalization performance. We explored the performance of backpropagation algorithm; conjugate gradient algorithm, quasi-Newton algorithm and Levenberg–Marquardt algorithm for the three chaotic time series. Performances of the different learning algorithms were evaluated when the activation functions and architecture were changed. We further present the theoretical background, algorithm, design strategy and further demonstrate how effective and inevitable is the proposed MLEANN framework to design a neural network, which is smaller, faster and with a better generalization performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Sexton, R. S., Dorsey, R. E., & Johnson, J. D. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00114-3 · Cited by 235
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
Self-citationNeural networks: An overview of early research, current frameworks and new challenges
Prieto, A., Prieto, B., Ortigosa, E. M., Ros, E., Pelayo, F., Ortega, J., & Rojas, I. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.06.014 · Cited by 391
Abraham, A. (2005) · Handbook of Measuring System Design · doi:10.1002/0471497398.mm421 · Cited by 339
Self-citationKaveh, M., & Mesgari, M. S. (2023) · Neural Processing Letters · doi:10.1007/s11063-022-11055-6 · Cited by 292
Metadata
- Authors
- Abraham, A.
- Venue
- Neurocomputing
- Publisher
- Elsevier BV
- Published
- 2004-01
- Volume
- 56
- Pages
- 1-38
- ISSN
- 0925-2312 (ISSN-L)
- OpenAlex
- W2022290342
- Cited by
- 175
- References
- 2
- FWCI
- 6.71
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Meta learning evolutionary artificial neural networks. https://app.cochat.ai/papers/10.1016/s0925-2312(03)00369-2
- The paper
- Abraham, A. (2004). Meta learning evolutionary artificial neural networks. Neurocomputing. https://doi.org/10.1016/s0925-2312(03)00369-2
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.