Skip to main content

Robust Centre Location in Radial Basis Function Networks

  • Conference paper
  • 429 Accesses

Abstract

One of the most important and broadly accepted solutions for the centre selection problem in radial basis function networks is due to Moody and Darken (1989), who propose to cluster the input vectors via the k-means clustering method. In this paper, an alternative robust solution, based on the spatial median, is proposed and compared also to the k-medoids method (Kaufman and Rousseeuw, 1990). Some simulation studies in the context of classification problems show that, when outlying data are present, the solution we propose improves the network performance and allows to define a more parsimonious network.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • BISHOP, M.C. (1995): Neural Networks for Pattern Recognition. Clarendon Press, Oxford.

    Google Scholar 

  • BOBROWSKI, L. and BEZDEK, J.C. (1996): c-Means Clustering with the L 1 and L∞ Norms. IEEE Transactions on Systems, Man and Cybernetics, 21, 545–554.

    Article  MathSciNet  Google Scholar 

  • BREIMAN, L, FRIEDMAN, J., OLSHEN, R, and STONE, C. (1984): Classification and Regression Trees. Wadsworth and Broooks/Cole, Monterey.

    MATH  Google Scholar 

  • COOPER, L. (1963): Location-Allocation Problems. Operational Research, 11, 331–343.

    MATH  Google Scholar 

  • CUESTA-ALBERTOS, J.A., GORDALIZA, A., and MATRAN, C. (1997): Trimmed k-Means: An Attempt to Robustify Quantizers. Annals of Statistics, 25, 553–576.

    Article  MathSciNet  MATH  Google Scholar 

  • GARCIA-ESCUDERO, L.A., GORDALIZA, A., and MATRAN, C. (1997): k-Medians and Trimmed k-Medians. Student, 2, 139–148.

    Google Scholar 

  • GOWER, J.C. (1974): The Mediancentre. Applied Statistics, 23, 466–47

    Article  Google Scholar 

  • KAUFMAN, L. and ROUSSEEUW, P.L. (1990): Finding Groups in Data. Wiley, New York.

    Book  Google Scholar 

  • LAY, S.R. and HWANG, J.N. (1993): Robust Construction of Radial Basis Function Networks for Classification. IEEE International Conference on Neural Networks, 1859–1864.

    Google Scholar 

  • MACQUEEN, J. (1967): Some Methods for Classification and Analysis of Multi-variate Observations. In: L.M. LeCam and J. Neyman (Eds.), Proceedings of the 5th Berkeley Symposium on Mathematical Statististics and Probability, 1, 281–297.

    Google Scholar 

  • MOODY, J. and DARKEN, C.J. (1989): Fast Learning in Network of Locally-Tuned Processing Units. Neural Computation, 1, 281–294.

    Article  Google Scholar 

  • PILLATI, M. (2001): Le Reti Neurali in Problemi di Classificazione: una Soluzione Basata sui Metodi di Segmentazione Binaria. Statistica, 3, 407–421.

    MathSciNet  Google Scholar 

  • POGGIO, T. and GIROSI, F. (1990): Networks for Approximation and Learning. Proceeding of the IEEE, 78, 1481–1497.

    Article  Google Scholar 

  • RIPLEY, B.D. (1996): Pattern Recognition and Neural Networks. Cambridge University Press, Cambridge.

    MATH  Google Scholar 

  • SMALL, G. (1990): A Survey of Multidimensional Medians. International Statistical Review, 58, 263–277.

    Article  Google Scholar 

  • SPATH, H. (1980): Cluster Analysis Algorithms. Ellis Horwood Limited, Chichester.

    Google Scholar 

  • VARDI, Y. and ZHANG, C. (1999): The Multivariate Li-Median and Associated Data Depth. Proceedings of the National Academy of Sciences of the United States of America. 97, 1423–1426.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pillati, M., Calò, D.G. (2004). Robust Centre Location in Radial Basis Function Networks. In: Bock, HH., Chiodi, M., Mineo, A. (eds) Advances in Multivariate Data Analysis. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17111-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17111-6_10

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-17111-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics