Skip to main content

Dynamic Complex-Valued Associative Memory with Strong Bias Terms

  • Conference paper
Neural Information Processing (ICONIP 2011)

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

Included in the following conference series:

Abstract

Complex-valued associative memory (CAM) can store multi-level patterns. Dynamic complex-valued associative memory (DCAM) can recall all stored patterns. The CAM stores the rotated patterns, which are typical spurious states, in addition to given training patterns. So DCAM recalls all the rotated patterns in the recall process. We introduce strong bias terms to avoid recalling the rotated patterns. By computer simulations, we can see that strong bias terms can avoid recalling the rotated patterns unlike simple bias terms.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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 of the United States of America 79(8), 2554–2558 (1982)

    Article  MathSciNet  Google Scholar 

  2. Hopfield, J.J.: Neurons with graded response have collective computational properties like those of two-state neurons. National Academy of Sciences of the United States of America 81(10), 3088–3092 (1984)

    Article  Google Scholar 

  3. Jankowski, S., Lozowski, A., Zurada, J.M.: Complex-valued multistate neural sssociative memory. IEEE Transaction on Neural Networks 7(6), 1491–1496 (1996)

    Article  Google Scholar 

  4. Kitahara, M., Kobayashi, M., Hattori, M.: Chaotic rotor associative memory. In: Proceedings of International Symposium on Nonlinear Theory and its Applications, pp. 399–402 (2009)

    Google Scholar 

  5. Lee, D.L.: Improvements of complex-valued hopfield associative memory by using generalized projection rules. IEEE Transaction on Neural Networks 17(5), 1341–1347 (2006)

    Article  Google Scholar 

  6. Muezzinoglu, M.K., Guzelis, C., Zurada, J.M.: A new design method for the complex-valued multistate hopfield associative memory. IEEE Transaction on Neural Networks 14(4), 891–899 (2003)

    Article  Google Scholar 

  7. Nagumo, J., Sato, S.: On a response characteristic of a mathmatical neural model. Kybernetik 10(3), 155–164 (1972)

    Article  MATH  Google Scholar 

  8. Nakada, M., Osana, Y.: Chaotic complex-valued associative memory. In: Proc. International Symposium on Nonlinear Theory and its Applications, pp. 493–496 (2007)

    Google Scholar 

  9. Zemel, R.S., Williams, C.K.I., Mozer, M.C.: Lending direction to neural networks. Neural Networks 8(4), 503–512 (1995)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Suzuki, Y., Kitahara, M., Kobayashi, M. (2011). Dynamic Complex-Valued Associative Memory with Strong Bias Terms. In: Lu, BL., Zhang, L., Kwok, J. (eds) Neural Information Processing. ICONIP 2011. Lecture Notes in Computer Science, vol 7062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24955-6_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24955-6_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24954-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics