Controlling complexity of RBF networks by similarity

Rückert U, Eickhoff R (2007)
In: ESANN. 181-186.

Download
OA
Conference Paper | Published | English
Author
;
Abstract
Using radial basis function networks for function approximation tasks suffers from unavailable knowledge about an adequate network size. In this work, a measuring technique is proposed which can control the model complexity and is based on the correlation coefficient between two basis functions. Simulation results show good performance and, therefore, this technique can be integrated in the RBF training procedure.
Publishing Year
PUB-ID

Cite this

Rückert U, Eickhoff R. Controlling complexity of RBF networks by similarity. In: ESANN. 2007: 181-186.
Rückert, U., & Eickhoff, R. (2007). Controlling complexity of RBF networks by similarity. ESANN, 181-186.
Rückert, U., and Eickhoff, R. (2007). “Controlling complexity of RBF networks by similarity” in ESANN 181-186.
Rückert, U., & Eickhoff, R., 2007. Controlling complexity of RBF networks by similarity. In ESANN. pp. 181-186.
U. Rückert and R. Eickhoff, “Controlling complexity of RBF networks by similarity”, ESANN, 2007, pp.181-186.
Rückert, U., Eickhoff, R.: Controlling complexity of RBF networks by similarity. ESANN. p. 181-186. (2007).
Rückert, Ulrich, and Eickhoff, Ralf. “Controlling complexity of RBF networks by similarity”. ESANN. 2007. 181-186.
Main File(s)
Access Level
OA Open Access
Last Uploaded
2011-10-26 11:10:55

This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar