Skip to main content

A Fate of Two Evolutionary Walkers after the Departure from the Origin

  • Conference paper
Neural Networks and Soft Computing

Part of the book series: Advances in Soft Computing ((AINSC,volume 19))

Abstract

Using Sammon mappings, a method to visualize multidimensional space, we observe a strange difference between two evolutionary searches: Evolutionary Programming and Breeder Genetic Algorithm, when they search for weight solutions of fully connected neural network model of associative memory.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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.

References

  • Collins, T. D. (1997) Using Software Visualization Technology to Help Evolutionary Algorithm Users Validate their Solutions. Proceedings of the 7th International Conference on Genetic Algorithms, pp.307–314.

    Google Scholar 

  • Gardner, E. (1988) The Phase Space of Interactions in Neural Network Models. Journal of Physics, 21A, pp. 257–270.

    Google Scholar 

  • Hopfield, J. J. (1982) Neural Networks and Physical Systems with Emergent Collective Computational Abilities. Proc. of the National Academy of Sciences, USA 79, pp. 2554–2558.

    Google Scholar 

  • Hebb, D. O. (1949) The Organization of Behavior. Wiley.

    Google Scholar 

  • Komlós, J., and R. Paturi (1988) Convergence Results in an Associative Memory Model. Neural Networks 1, pp. 239–250.

    Google Scholar 

  • Mühlenbein, H. and D. Schlierkamp-Voosen (1995) Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization. Evolutionary Computation Vol. 1 (1996), pp. 25–49.

    Article  Google Scholar 

  • Sammon, J. W. (1969) A Nonlinear Mapping for Data Structure Analysis. IEEE Transactions on Computers. C-18(5), pp.401–408.

    Google Scholar 

  • Shine, W. B. and C. F. Eick (1997) Visualizing the Evolution of Genetic Algorithm Search Processes. Proceedings of the IEEE International Conference on Evolutionary Computation, pp.367–372.

    Google Scholar 

  • Syswerda, G. (1989) Uniform Crossover in Genetic Algorithms. Proceedings of the 3rd International Conference on Genetic Algorithms, pp.2–9.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Imada, A. (2003). A Fate of Two Evolutionary Walkers after the Departure from the Origin. In: Rutkowski, L., Kacprzyk, J. (eds) Neural Networks and Soft Computing. Advances in Soft Computing, vol 19. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1902-1_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-7908-1902-1_51

  • Publisher Name: Physica, Heidelberg

  • Print ISBN: 978-3-7908-0005-0

  • Online ISBN: 978-3-7908-1902-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics