Skip to main content

Nature Inspired Methods in the Radial Basis Function Network Learning Process

  • Conference paper
Artificial Neural Networks - ICANN 2008 (ICANN 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5164))

Included in the following conference series:

Abstract

In present we benefit from the use of nature processes which provide us with highly effective heuristics for solving various problems. Their advantages are mainly prominent in hybrid approach. This paper evaluates several approaches for learning neural network based on Radial Basis Function (RBF) for distinguishing different sets in \(\mathcal{R}^{L}\). RBF networks use one layer of hidden RBF units and the number of RBF units is kept constatnt. In the paper we evaluate the ACO\(_\mathcal{R}\) (Ant Colony Approach for Real domain) approach inspired by ant behavior and the PSO (Particle Swarm Optimization) algorithm inspired by behavior of flock of birds or fish in the nature. Nature inspired and classical algorithms are compared and evaluated.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

References

  1. Adami, C.: Introduction to Artificial Life. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  2. Broomhead, D., Lowe, D.: Multivariable functional interpolation and adaptive networks. Complex Systems 2, 321–355 (1988)

    MATH  MathSciNet  Google Scholar 

  3. Socha, K., Dorigo, M.: Ant colony optimization for continuous domains. European Journal of Operational Research 185(3), 1155–1173 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  4. Asuncion, A., Newman, D.: UCI machine learning repository (2007)

    Google Scholar 

  5. Fritzke, B.: Growing cell structures – a self-organizing network for unsupervised and supervised learning. Neural Networks 7(9), 1441–1460 (1994)

    Article  Google Scholar 

  6. Moody, J., Darken, C.: Learning with localized receptive fields. In: Rouretzky, D., Sejnowski, T. (eds.) Proceedings of the 1988 Connectionist Models Summer School, pp. 133–143. Morgan Kaufmann, San Mateo (1989)

    Google Scholar 

  7. Moody, J.: Fast learning in networks of locally-tuned processing units. Neural Computation 1, 281–294 (1989)

    Article  Google Scholar 

  8. Chen, S., Cowan, C.F.N., Grant, P.M.: Orthogonal least squares learning algorithm for radial basis function nertworks. IEEE Transactions on Neural Networks 2(2), 302–309 (1991)

    Article  Google Scholar 

  9. Cha, I., Kassam, S.A.: Rbfn restoration of nonlinearly degraded images. IEEE Transactions on Image Processing 5(6), 964–975 (1990)

    Google Scholar 

  10. Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  11. Grasse, P.P.: La reconstruction du nid et les coordinations inter-individuelles chez bellicositermes natalensis et cubitermes sp. la thorie de la stigmergie: Essai d’interprtation des termites constructeurs. Insectes Sociaux 6, 41–81 (1959)

    Article  Google Scholar 

  12. Bilchev, G., Parmee, I.C.: The ant colony metaphor for searchin continuous design spaces. In: Proc. of AISB Workshop on Evolutionary Computing. LNCS, pp. 25–39. Springer, Heidelberg (1993)

    Google Scholar 

  13. Monmarche, N., Venturini, G., Slimane, M.: On how pachycondyla apicalis ants suggest a new search algorithm. Future generation comput. syst. 16, 937–946 (2000)

    Article  Google Scholar 

  14. Dreo, J., Siarry, P.: A new ant colony algorithm using the heterarchical concept aimed at optimization of multiminima continuous functions. In: Dorigo, M., Di Caro, G., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, Springer, Heidelberg (2002)

    Google Scholar 

  15. Blum, C.: Ant colony optimization: Introduction and recent trends. Physics of Life Reviews 2(4), 353–373 (2005)

    Article  MathSciNet  Google Scholar 

  16. Dorigo, M., Blum, C.: Ant colony optimization theory: A survey. Theoretical Computer Science 344(2–3), 243–278 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  17. Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings IEEE International Conference on Neural Networks IV, pp. 1942–1948 (1995)

    Google Scholar 

  18. Bezdek, J.C., Li, W.Q., Attikiouzel, Y.A., Windham, M.P.: A geometric approach to cluster validity for normal mixtures. Soft Computing 1, 166–179 (1997)

    Google Scholar 

  19. Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Transactions on Pattern Recognition and Machine Intelligence 1(2), 224–227 (1979)

    Article  Google Scholar 

  20. Smaldon, J., Freitas, A.A.: A new version of the ant-miner algorithm discovering unordered rule sets. In: GECCO 2006: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pp. 43–50. ACM, New York (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Véra Kůrková Roman Neruda Jan Koutník

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burša, M., Lhotská, L. (2008). Nature Inspired Methods in the Radial Basis Function Network Learning Process. In: Kůrková, V., Neruda, R., Koutník, J. (eds) Artificial Neural Networks - ICANN 2008. ICANN 2008. Lecture Notes in Computer Science, vol 5164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87559-8_86

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87559-8_86

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-87559-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics