Pareto-optimal noise and approximation properties of RBF networks

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Neural networks are intended to be robust to noise and tolerant to failures in their architecture. Therefore, these systems are particularly interesting to lie integrated in hardware and to be operating under noisy environment. In this work, measurements are introduced which can decrease the sensitivity of Radial Basis Function networks to noise without any degradation in their approximation capability. For this purpose, pareto-optimal solutions are determined for the parameters of the network. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Eickhoff, R., & Rückert, U. (2006). Pareto-optimal noise and approximation properties of RBF networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4131 LNCS-I, pp. 993–1002). Springer Verlag. https://doi.org/10.1007/11840817_103

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free