The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Selection of Proper Neural Network Sizes and Architectures—A Comparative Study
Abstract
One of the major difficulties facing researchers using neural networks is the selection of the proper size and topology of the networks. The problem is even more complex because often when the neural network is trained to very small errors, it may not respond properly for patterns not used in the training process. A partial solution proposed to this problem is to use the least possible number of neurons along with a large number of training patterns. The discussion consists of three main parts: first, different learning algorithms, including the Error Back Propagation (EBP) algorithm, the Levenberg Marquardt (LM) algorithm, and the recently developed Neuron-by-Neuron (NBN) algorithm, are discussed and compared based on several benchmark problems; second, the efficiency of different network topologies, including traditional Multilayer Perceptron (MLP) networks, Bridged Multilayer Perceptron (BMLP) networks, and Fully Connected Cascade (FCC) networks, are evaluated by both theoretical analysis and experimental results; third, the generalization issue is discussed to illustrate the importance of choosing the proper size of neural networks.
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
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
Advances in Neural Information Processing Systems 19
(2007) · The MIT Press eBooks · doi:10.52202/085713 · Cited by 15,539
A method for the solution of certain non-linear problems in least squares
Levenberg, K. (1944) · Quarterly of Applied Mathematics · doi:10.1090/qam/10666 · Cited by 12,359
Training feedforward networks with the Marquardt algorithm
Hagan, M. T., & Menhaj, M. B. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.329697 · Cited by 7,701
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
Orthogonal least squares learning algorithm for radial basis function networks
Chen, S., Cowan, C. F. N., & Grant, P. M. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80341 · Cited by 3,362
Structure identification of fuzzy model
Sugeno, M., & Kang, G. T. (1988) · Fuzzy Sets and Systems · doi:10.1016/0165-0114(88)90113-3 · Cited by 2,715
Cover, T. M. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.264137 · Cited by 2,044
Deep Machine Learning - A New Frontier in Artificial Intelligence Research [Research Frontier]
Arel, I., Rose, D. C., & Karnowski, T. P. (2010) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2010.938364 · Cited by 1,121
An empirical study of learning speed in back-propagation networks
Fahlman, S. E. (2018) · doi:10.1184/r1/6603266 · Cited by 829
Cited by
The internet of things: a survey
Li, S., Xu, L. D., & Zhao, S. (2015) · Information Systems Frontiers · doi:10.1007/s10796-014-9492-7 · Cited by 2,297
Review on Methods to Fix Number of Hidden Neurons in Neural Networks
Sheela, K. G., & Deepa, S. N. (2013) · Mathematical Problems in Engineering · doi:10.1155/2013/425740 · Cited by 941
Khayyam, H., Jazar, R. N., Nunna, S., Golkarnarenji, G., Badii, K., Fakhrhoseini, S. M., Kumar, S., & Naebe, M. (2020) · Progress in Materials Science · doi:10.1016/j.pmatsci.2019.100575 · Cited by 325
Deshpande, G., Wang, P., Rangaprakash, D., & Wilamowski, B. (2015) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2014.2379621 · Cited by 161
Self-citation
Metadata
- Authors
- Hunter, D., Yu, H., Pukish, III, Kolbusz, J., & Wilamowski, B. M.
- Venue
- IEEE Transactions on Industrial Informatics
- Published
- 2012-05
- Volume
- 8
- Issue
- 2
- Pages
- 228-240
- ISSN
- 1551-3203 (ISSN-L)
- 1941-0050
- OpenAlex
- W2125818553
- Cited by
- 415
- References
- 42
- FWCI
- 23.75
- 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: Selection of Proper Neural Network Sizes and Architectures—A Comparative Study. https://app.cochat.ai/papers/10.1109/tii.2012.2187914
- The paper
- Hunter, D., Yu, H., Pukish, III, Kolbusz, J., & Wilamowski, B. M. (2012). Selection of Proper Neural Network Sizes and Architectures—A Comparative Study. IEEE Transactions on Industrial Informatics. https://doi.org/10.1109/tii.2012.2187914
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.