Skip to main content

Dependence on Memory Pattern in Sensitive Response of Memory Fragments among Three Types of Chaotic Neural Network Models

  • Conference paper
Neural Information Processing. Theory and Algorithms (ICONIP 2010)

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

Included in the following conference series:

Abstract

In this paper, we investigate the dependence on the size and the number of memory pattern in the sensitive response to memory pattern fragments in chaotic wandering states among three types of chaotic neural network (CNN) models. From the computer experiments, the three types of chaotic neural network model show that the success ratio is high and the accessing time is short without depending on the size and the number of the memory patterns. The feature is introduced in chaotic wandering states with weaker instability of orbits and stronger randomness in memory pattern space. Thus, chaos in the three model is practical in the memory pattern search.

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.

References

  1. Nara, S., Davis, P., Kawachi, M., Totsuji, H.: Chaotic Memory Dynamics in a Recurrent Neural Network with Cycle Memories Embeded by Pseudoinverse Method. J. Bifurcation & Chaos 5, 1205–1212 (1995)

    Article  MATH  Google Scholar 

  2. Nara, S.: Can potentially useful dynamics to solve complex problems emerge from constrained chaos and /or chaotic itinerancy? Chaos 13, 1110–1121 (2003)

    Article  Google Scholar 

  3. Mikami, S., Nara, S.: Dynamical response of chaotic memory dynamics to weak input in a recurrent neural network model. Neural Comput. Appl. 11, 129–136 (2003)

    Article  MATH  Google Scholar 

  4. Kuroiwa, J., Masutani, S., Nara, S., Aihara, K.: Sensitive responses of chaotic wandering to memory pattern fragment inputs in a chaotic neural network model. Int. J. Bifurcation & Chaos 14, 1413–1421 (2004)

    Article  MATH  Google Scholar 

  5. Skarda, S.A., Freeman, J.K.: How brains make chaos in order to make sense of the world? Behavioral and Brain Sci. 10, 161–195 (1987)

    Article  Google Scholar 

  6. Nakayama, S., Kuroiwa, J., Nara, S.: Partly Inverted Synaptic Connections and Complex Dynamics in a Symmetric Recurrent Neural Network Model. In: Proceedings of international joint conference on neural network (ICONIP 2000), Taejon, Korea, vol. 2, pp. 1274–1279 (2000)

    Google Scholar 

  7. Aihara, K., Takabe, T., Toyoda, M.: Chaostic Neural Networks. Phys. Lett. A 144, 333–339 (1990)

    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

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hamada, T., Kuroiwa, J., Ogura, H., Odaka, T., Shirai, H., Suwa, I. (2010). Dependence on Memory Pattern in Sensitive Response of Memory Fragments among Three Types of Chaotic Neural Network Models. In: Wong, K.W., Mendis, B.S.U., Bouzerdoum, A. (eds) Neural Information Processing. Theory and Algorithms. ICONIP 2010. Lecture Notes in Computer Science, vol 6443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17537-4_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17537-4_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17536-7

  • Online ISBN: 978-3-642-17537-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics