Skip to main content

Constructive methods for a new classifier based on a radial-basis-function neural network accelerated by a tree

  • Conference paper
  • First Online:
Book cover New Trends in Neural Computation (IWANN 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 686))

Included in the following conference series:

Abstract

We present a new constructive algorithm for building Radial-Basis-Function (RBF) network classifiers and a tree based associated algorithm for fast processing of the network. This method, named Constructive Tree Radial-Basis-Function (CTRBF), allows to build and train a RBF network in one pass over the training data set. The training can be in supervised or unsupervised mode. Furthermore, the algorithm is not restricted to fixed input size problems. Several construction and pruning strategies are discussed. We tested and compared this algorithm with classical RBF and multilayer perceptrons on a real world problem: on-line handwritten character recognition. While instantaneous incremental learning is the major property of the architecture, the tree associated to the RBF network gives impressive speed improvement with minimal performance losses. Speed-up factors of 20 over classical RBF have been obtained.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Makram-Ebeid, and al., A rationalized error backpropagation algorithm, Proc. INNS, Washington, DC, June 18–22,(1989)

    Google Scholar 

  2. J. Park, I.W. Sandberg, Universal Approximation Using Radial-Basis-Function Networks, Neural Computation 3, 246–257 (1991)

    Google Scholar 

  3. E. Hartmann, J.D. Keeler, Predicting the Future: Advantage of Semilocal Units, Neural Computation 3, 566–578 (1991)

    Google Scholar 

  4. J. Moody and C. Darken, Learning with localized receptive fields, Proceedings of the 1988 Connectionisi Models Summer School, ed. D. Touretzky, Morgan Kaufmann Publishing, San Mateo, CA, pp. 133–143, (1988).

    Google Scholar 

  5. A. Saha and J.D. Keeler, Algorithms for better representation and faster learning in radial basis function networks, Neural Information Processing Systems, ed. D. Touretzky, Morgan Kaufmann, San Mateo, CA, 482–489, (1990).

    Google Scholar 

  6. M.T. Musavi and al. On the training of radial basis function classifiers Neural Networks 5, 595–603 (1992).

    Google Scholar 

  7. P. Simard, Y. Le Cun, J. Denker, B. Victorri, An efficient algorithm for learning invariances in adaptive classifiers. To be published in IAPR.

    Google Scholar 

  8. P. Gentric, On-line handwriting recognition for small computer. Sixth International Conference on Handwriting and Drawing, Paris July 5–6–7, (1993).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

José Mira Joan Cabestany Alberto Prieto

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gentric, P., Withagen, H.C.A.M. (1993). Constructive methods for a new classifier based on a radial-basis-function neural network accelerated by a tree. In: Mira, J., Cabestany, J., Prieto, A. (eds) New Trends in Neural Computation. IWANN 1993. Lecture Notes in Computer Science, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56798-4_135

Download citation

  • DOI: https://doi.org/10.1007/3-540-56798-4_135

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56798-1

  • Online ISBN: 978-3-540-47741-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics