# Universal approximation using radial-basis-function networks

**Jisun Park****Irwin W. Sandberg**

CiteWeb id: 19910000240

CiteWeb score: 2561

There have been several recent studies concerning feedforward networks and the problem of approximating arbitrary functionals of a finite number of real variables. Some of these studies deal with cases in which the hidden-layer nonlinearity is not a sigmoid. This was motivated by successful applications of feedforward networks with nonsigmoidal hidden-layer units. This paper reports on a related study of radial-basis-function (RBF) networks, and it is proved that RBF networks having one hidden layer are capable of universal approximation. Here the emphasis is on the case of typical RBF networks, and the results show that a certain class of RBF networks with the same smoothing factor in each kernel node is broad enough for universal approximation.

**Universal approximation using radial-basis-function networks**" is placed in the Top 10000 of the best publications in CiteWeb. Also in the category Computer Science it is included to the Top 10000. Additionally, the publicaiton "

**Universal approximation using radial-basis-function networks**" is placed in the Top 1000 among other scientific works published in 1991.

- www.mitpressjournals.org/doi/pdf/10.1162/neco.1991.3.2.246
- www.mitpressjournals.org/doi/abs/10.1162/neco.1991.3.2.246
- dl.acm.org/citation.cfm?id=110084.110093
- https://www.deepdyve.com/lp/mit-press/universal-approximation-using-radial-basis-function-networks-RPx6Xvxr2Y
- dx.doi.org/10.1162/neco.1991.3.2.246
- cognet.mit.edu/journal/10.1162/neco.1991.3.2.246
- ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6797088
- www.deepdyve.com/lp/mit-press/universal-approximation-using-radial-basis-function-networks-RPx6Xvxr2Y

Jisun Park, Irwin W. Sandberg,

Universal approximation using radial-basis-function networks(1991)## HTML code:

## Wiki code: