Skip to main content

A New Incremental Strategy for Function Approximation by Radial Basis Function Neural Networks

  • Conference paper
Neural Nets WIRN VIETRI-98

Part of the book series: Perspectives in Neural Computing ((PERSPECT.NEURAL))

Abstract

In this paper we present a new incremental learning algorithm for approximating continuous mapping. The algorithm uses radial basis functions as activation functions. The novelty of the algorithm has different aspects: First, the learning procedure is accomplished modifying only the variances of the activation functions instead of the weights on the synapses; Secondly, the variances of the radial basis functions are trained by a two stage strategy, which includes a local optimization of each new neuron variance. An evolutionary optimization algorithm instead of the usual backpropagation algorithm is used to train the variances. The ability of the net to save training time depends on selectively growing the net structure and on the capability of the algorithm to preserve the locality of the activation functions.

Moreover, reported are comparisons with other incremental algorithm in the literature. Such comparisons show that our net perform better both in terms of net size (few hidden neuron are sufficient to reach very good approximations), and in terms of computational time (the training phase is accomplished on a PC computer and require few minutes).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. E. Hartman, J. Keeler, J. Kowalsky. Neural Computation 2 1990

    Google Scholar 

  2. F. Girosi and T. Poggio, Networks and the best approximation property. Biological Cybernetics 63 1990

    Google Scholar 

  3. J. Park and I. Sandberg, Neural Computation 3 1991, 5 1993

    Google Scholar 

  4. J. Moody and C. Darken, Fast Learning in networks of locally-tuned processing units. Neural Computation 1 1989

    Google Scholar 

  5. C. Bishop, Neural Networks for Pattern Recognition Clarendon Press Oxford, 1995

    Google Scholar 

  6. V. Vinod and S. Ghose, Growing nonuniform feedforward networks for continuous mappings. Neurocomputing 10 1996

    Google Scholar 

  7. F. Yong and T. Chow, Neural Network Adaptive Wavelets for Function Approximation, Department of Electronic Engineering, City University, Hong Kong, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag London Limited

About this paper

Cite this paper

Esposito, A., Marinaro, M., Oricchio, D., Scarpetta, S. (1999). A New Incremental Strategy for Function Approximation by Radial Basis Function Neural Networks. In: Marinaro, M., Tagliaferri, R. (eds) Neural Nets WIRN VIETRI-98. Perspectives in Neural Computing. Springer, London. https://doi.org/10.1007/978-1-4471-0811-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0811-5_8

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-1208-2

  • Online ISBN: 978-1-4471-0811-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics