Skip to main content

Divided Chaotic Associative Memory for Successive Learning

  • Conference paper
Advances in Neuro-Information Processing (ICONIP 2008)

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

Included in the following conference series:

  • 1552 Accesses

Abstract

In this paper, we propose a Divided Chaotic Associative Memory for Successive Learning (DCAMSL). The proposed model is based on the Improved Chaotic Associative Memory for Successive Learning (ICAMSL) and the Divided Chaotic Associative Memory for Successive Learning using Internal Patterns (DCAMSL-IP) which were proposed in order to improve the storage capacity. In most of the conventional neural network models, the learning process and the recall process are divided, and therefore they need all information to learning in advance. However, in the real world, it is very difficult to get all information to learn in advance. So we need the model whose learning and recall processes are not divided. As such model, although some models have been proposed, their storage capacity is small. In the proposed DCAMSL, the learning process and the recall process are not divided and its storage capacity is larger than that of the conventional ICAMSL.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proceedings of the National Academy of Sciences U.S.A. 79, 2554–2558 (1982)

    Article  MathSciNet  Google Scholar 

  2. Kosko, B.: Bidirectional associative memory. IEEE Transactions on Neural Networks 18(1), 49–60 (1988)

    MathSciNet  Google Scholar 

  3. Carpenter, G.A., Grossberg, S.: Pattern Recognition by Self-organizing Neural Networks. MIT Press, Cambridge (1995)

    Google Scholar 

  4. Ikeya, T., Sazuka, T., Hagiwara, A., Osana, Y.: Improved chaotic associative memory for successive learning. In: Proceedings of IASTED Artificial Intelligence and Applications, Innsbruck (2007)

    Google Scholar 

  5. Kawasaki, N., Osana, Y., Hagiwara, M.: Divided chaotic associative memory for successive learning using internal patterns. In: Proceedings of 7th International Conference on Neural Information Processing, Taejon (2000)

    Google Scholar 

  6. Huang, J.T., Hagiwara, M.: A multi-winners self-organizing neural network. In: IEEE International Conference on System, Man and Cybernetics, pp. 2499–2504 (1997)

    Google Scholar 

  7. Aihara, K., Takabe, T., Toyoda, M.: Chaotic neural networks. Physics Letter A 144(6,7), 333–340 (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

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hada, T., Osana, Y. (2009). Divided Chaotic Associative Memory for Successive Learning. In: Köppen, M., Kasabov, N., Coghill, G. (eds) Advances in Neuro-Information Processing. ICONIP 2008. Lecture Notes in Computer Science, vol 5507. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03040-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03040-6_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03039-0

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics