The DOI matches its Crossref record; 71 of the 71 references it cites were found in a registry or an index.
Networks for approximation and learning
Abstract
The problem of the approximation of nonlinear mapping, (especially continuous mappings) is considered. Regularization theory and a theoretical framework for approximation (based on regularization techniques) that leads to a class of three-layer networks called regularization networks are discussed. Regularization networks are mathematically related to the radial basis functions, mainly used for strict interpolation tasks. Learning as approximation and learning as hypersurface reconstruction are discussed. Two extensions of the regularization approach are presented, along with the approach's corrections to splines, regularization, Bayes formulation, and clustering. The theory of regularization networks is generalized to a formulation that includes task-dependent clustering and dimensionality reduction. Applications of regularization networks are discussed.>
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
(1967) · Cited by 23,719
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Self-organized formation of topologically correct feature maps
Kohonen, T. (1982) · Biological Cybernetics · doi:10.1007/bf00337288 · Cited by 9,529
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
The coordination of arm movements: an experimentally confirmed mathematical model
Flash, T., & Hogan, N. (1985) · The Journal of Neuroscience · doi:10.1523/jneurosci.05-07-01688.1985 · Cited by 4,395
Cited by
Items 101–115 of 115
Nonparametric multivariate density estimation: a comparative study
Hwang, J.-N., Lay, S.-R., & Lippman, A. (1994) · IEEE Transactions on Signal Processing · doi:10.1109/78.324744 · Cited by 284
Support Vector Machines Applications
(2014) · Springer eBooks · doi:10.1007/978-3-319-02300-7 · Cited by 281
Locally recurrent globally feedforward networks: a critical review of architectures
Tsoi, A. C., & Back, A. D. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279187 · Cited by 279
On-line EM Algorithm for the Normalized Gaussian Network
Sato, M.-A., & Ishii, S. (2000) · Neural Computation · doi:10.1162/089976600300015853 · Cited by 276
Theory and development of higher-order CMAC neural networks
(1992) · IEEE Control Systems · doi:10.1109/37.126849 · Cited by 276
Computing with Spiking Neuron Networks
Paugam-Moisy, H., & Bohte, S. (2012) · Handbook of Natural Computing · doi:10.1007/978-3-540-92910-9_10 · Cited by 272
Approximation of nonlinear systems with radial basis function neural networks
Schilling, R. J., Carroll, J. J., & Al-Ajlouni, A. F. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.896792 · Cited by 263
Giannakoglou, K. C. (2002) · Progress in Aerospace Sciences · doi:10.1016/s0376-0421(01)00019-7 · Cited by 259
Accuracy analysis for wavelet approximations
Delyon, B., Juditsky, A., & Benveniste, A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.363469 · Cited by 259
Efficient Implementation of High Dimensional Model Representations
Alış, Ö. F., & Rabitz, H. (2001) · Journal of Mathematical Chemistry · doi:10.1023/a:1010979129659 · Cited by 257
Piotrowski, A. P., & Napiorkowski, J. J. (2013) · Journal of Hydrology · doi:10.1016/j.jhydrol.2012.10.019 · Cited by 257
Robust radial basis function neural networks
Lee, C.-C., Chung, P.-C., Tsai, J.-R., & Chang, C.-I. (1999) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.809023 · Cited by 256
NONLINEAR GATED EXPERTS FOR TIME SERIES: DISCOVERING REGIMES AND AVOIDING OVERFITTING
WEIGEND, A. S., MANGEAS, M., & SRIVASTAVA, A. N. (1995) · International Journal of Neural Systems · doi:10.1142/s0129065795000251 · Cited by 253
Whitehead, B. A., & Choate, T. D. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.508930 · Cited by 253
Comparisons of the Performance of Computational Intelligence Methods for Loan Granting Decisions
Zurada, J., & Kunene, K. N. (2011) · 2011 44th Hawaii International Conference on System Sciences · doi:10.1109/hicss.2011.118 · Cited by 13
Metadata
- Authors
- Poggio, T., & Girosi, F.
- Venue
- Proceedings of the IEEE
- Published
- 1990
- Volume
- 78
- Issue
- 9
- Pages
- 1481-1497
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2143956139
- Cited by
- 3,252
- References
- 71
- FWCI
- 66.08
- 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.