The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Neural network architectures and learning algorithms
Abstract
Neural networks are the topic of this paper. Neural networks are very powerful as nonlinear signal processors, but obtained results are often far from satisfactory. The purpose of this article is to evaluate the reasons for these frustrations and show how to make these neural networks successful. The following are the main challenges of neural network applications: (1) Which neural network architectures should be used? (2) How large should a neural network be? (3) Which learning algorithms are most suitable? The multilayer perceptron (MLP) architecture is unfortunately the preferred neural network topology of most researchers. It is the oldest neural network architecture, and it is compatible with all training softwares. However, the MLP topology is less powerful than other topologies such as bridged multilayer perceptron (BMLP), where connections across layers are allowed. The error-back propagation (EBP) algorithm is the most popular learning algorithm, but it is very slow and seldom gives adequate results. The EBP training process requires 100-1,000 times more iterations than the more advanced algorithms such as Levenberg-Marquardt (LM) or neuron by neuron (NBN) algorithms. What is most important is that the EBP algorithm is not only slow but often it is not able to find solutions for close-to-optimum neural networks. The paper describes and compares several learning algorithms.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Learning representations by back-propagating errors
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1986) · Nature · doi:10.1038/323533a0 · Cited by 31,892
A direct adaptive method for faster backpropagation learning: the RPROP algorithm
Riedmiller, M., & Braun, H. (2002) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1993.298623 · Cited by 3,917
Cited by
Improved Computation for Levenberg–Marquardt Training
Wilamowski, B. M., & Yu, H. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2045657 · Cited by 622
Self-citationA review on COVID-19 forecasting models
Rahimi, I., Chen, F., & Gandomi, A. H. (2023) · Neural Computing and Applications · doi:10.1007/s00521-020-05626-8 · Cited by 282
Deshpande, G., Wang, P., Rangaprakash, D., & Wilamowski, B. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2379621 · Cited by 161
Self-citationA happiness degree predictor using the conceptual data structure for deep learning architectures
Pérez-Benito, F. J., Villacampa-Fernández, P., Conejero, J. A., García-Gómez, J. M., & Navarro-Pardo, E. (2019) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2017.11.004 · Cited by 20
Metadata
- Authors
- Wilamowski, B.
- Venue
- IEEE Industrial Electronics Magazine
- Published
- 2009-12
- Volume
- 3
- Issue
- 4
- Pages
- 56-63
- ISSN
- 1932-4529 (ISSN-L)
- OpenAlex
- W2019282798
- Cited by
- 355
- References
- 3
- FWCI
- 27.11
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Neural network architectures and learning algorithms. https://app.cochat.ai/papers/10.1109/mie.2009.934790
- The paper
- Wilamowski, B. (2009). Neural network architectures and learning algorithms. IEEE Industrial Electronics Magazine. https://doi.org/10.1109/mie.2009.934790
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.