The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Bounds on the number of hidden neurons in multilayer perceptrons
Abstract
Fundamental issues concerning the capability of multilayer perceptrons with one hidden layer are investigated. The studies are focused on realizations of functions which map from a finite subset of E(n) into E(d). Real-valued and binary-valued functions are considered. In particular, a least upper bound is derived for the number of hidden neurons needed to realize an arbitrary function which maps from a finite subset of E(n ) into E(d). A nontrivial lower bound is also obtained for realizations of injective functions. This result can be applied in studies of pattern recognition and database retrieval. An upper bound is given for realizing binary-valued functions that are related to pattern-classification problems.
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
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Approximation by superpositions of a sigmoidal function
Cybenko, G. (1989) · Mathematics of Control, Signals, and Systems · doi:10.1007/bf02551274 · Cited by 13,883
Adaptive pattern recognition and neural networks
(1989) · Choice Reviews Online · doi:10.5860/choice.26-6311 · Cited by 2,313
Introduction to linear and nonlinear programming
Polak, E. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100535 · Cited by 2,100
Cover, T. M. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.264137 · Cited by 2,044
Gesammelte Mathematische Abhandlungen: Erster Band
Schwarz, H. A. (1890) · Springer eBooks · doi:10.1007/978-3-642-50665-9 · Cited by 827
On the capabilities of multilayer perceptrons
Baum, E. B. (1988) · Journal of Complexity · doi:10.1016/0885-064x(88)90020-9 · Cited by 379
Principles of neurodynamics: Yu. G. Antomonov
Ivakhnenko, A. G. (1976) · Cybernetics · doi:10.1007/bf01071380 · Cited by 318
Internal representations for associative memory
Baum, E. B., Moody, J. E., & Wilczek, F. A. (1988) · Biological Cybernetics · doi:10.1007/bf00332910 · Cited by 129
Gesammelte Mathematische Abhandlungen
Schläfli, L. (1950) · Springer eBooks · doi:10.1007/978-3-0348-4118-4 · Cited by 123
Cited by
Maier, H. R., & Dandy, G. C. (2000) · Environmental Modelling & Software · doi:10.1016/s1364-8152(99)00007-9 · Cited by 2,377
Extreme learning machines: a survey
Huang, G.-B., Wang, D. H., & Lan, Y. (2011) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-011-0019-y · Cited by 1,914
Approximation theory of the MLP model in neural networks
Pinkus, A. (1999) · Acta Numerica · doi:10.1017/s0962492900002919 · Cited by 1,529
Progress in supervised neural networks
Hush, D. R., & Horne, B. G. (1993) · IEEE Signal Processing Magazine · doi:10.1109/79.180705 · Cited by 1,247
Concepts of Artificial Intelligence for Computer-Assisted Drug Discovery
Yang, X., Wang, Y., Byrne, R., Schneider, G., & Yang, S. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00728 · Cited by 1,022
Auto-encoder based dimensionality reduction
Wang, Y., Yao, H., & Zhao, S. (2016) · Neurocomputing · doi:10.1016/j.neucom.2015.08.104 · Cited by 976
Hydrological modelling using artificial neural networks
Dawson, C. W., & Wilby, R. L. (2001) · Progress in Physical Geography: Earth and Environment · doi:10.1177/030913330102500104 · Cited by 903
Nonlinear principal component analysis—Based on principal curves and neural networks
Dong, D., & McAvoy, T. J. (1996) · Computers & Chemical Engineering · doi:10.1016/0098-1354(95)00003-k · Cited by 628
Huang, G.-B., & Babri, H. A. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/72.655045 · Cited by 538
The use of backpropagating artificial neural networks in land cover classification
Kavzoglu, T., & Mather, P. M. (2003) · International Journal of Remote Sensing · doi:10.1080/0143116031000114851 · Cited by 457
Nonlinear PLS modeling using neural networks
Qin, S. J., & McAvoy, T. J. (1992) · Computers & Chemical Engineering · doi:10.1016/0098-1354(92)80055-e · Cited by 450
Capabilities of a four-layered feedforward neural network: four layers versus three
Tamura, S., & Tateishi, M. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.557662 · Cited by 422
Supervised pattern classification based on optimum‐path forest
Papa, J. P., Falcão, A. X., & Suzuki, C. T. N. (2009) · International Journal of Imaging Systems and Technology · doi:10.1002/ima.20188 · Cited by 365
Neural networks in geophysical applications
van der Baan, M., & Jutten, C. (2000) · Geophysics · doi:10.1190/1.1444797 · Cited by 342
Can genetic programming improve software effort estimation? A comparative evaluation
Burgess, C. J., & Lefley, M. (2001) · Information and Software Technology · doi:10.1016/s0950-5849(01)00192-6 · Cited by 300
An iterative pruning algorithm for feedforward neural networks
Castellano, G., Fanelli, A. M., & Pelillo, M. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572092 · Cited by 295
Classification ability of single hidden layer feedforward neural networks
Huang, G.-B., Chen, Y.-Q., & Babri, H. A. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846750 · Cited by 261
Metadata
- Authors
- Huang, S.-C., & Huang, Y.-F.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1991
- Volume
- 2
- Issue
- 1
- Pages
- 47-55
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2166915851
- Cited by
- 328
- References
- 15
- FWCI
- 15.90
- 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.