Skip to main content

Recovery of Performance in a Partially Connected Associative Memory Network Through Coding

  • Conference paper
Book cover Artificial Neural Networks: Biological Inspirations – ICANN 2005 (ICANN 2005)

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

Included in the following conference series:

  • 1553 Accesses

Abstract

Introducing partial connectivity to an associative memory network increases the variance of the dendritic sum distributions, reducing the performance. A coding scheme to compensate for this effect is considered, in which output patterns are self-organised by the network. It is shown using signal-to-noise ratio analysis that when the output patterns are self-organised the performance is greater than in a network with a higher connectivity and random patterns, in the regime of low connectivity and a high memory load. This analysis is supported by simulations. The self-organising network also outperforms the random network with input activity-dependent thresholding mechanisms in simulations.

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. Willshaw, D.J., Buneman, O.P., Longuet-Higgins, H.C.: Non-holographic associative memory. Nature 222(197), 960–962 (1969)

    Article  Google Scholar 

  2. Buckingham, J.: Delicate nets, faint recollections: a study of partially connected associative network memories. PhD thesis, Univ. Edinburgh (1991)

    Google Scholar 

  3. Marr, D.: Simple memory: a theory for archicortex. Phil. Trans. R. Soc. B. 262(841), 24–81 (1971)

    Article  Google Scholar 

  4. Buckingham, J., Willshaw, D.J.: On setting unit thresholds in an incompletely connected associative net. Network 4, 441–459 (1993)

    Article  Google Scholar 

  5. Graham, B., Willshaw, D.J.: Improving recall from an associative memory. Biol. Cybernetics 72, 337–346 (1995)

    Article  MATH  Google Scholar 

  6. Freund, T.F., Buzsaki, G.: Interneurons of the Hippocampus. Hippocampus 6, 347–470 (1996)

    Article  Google Scholar 

  7. Dayan, P., Willshaw, D.J.: Optimizing synaptic learning rules in linear associative memories. Biol. Cybernet. 65(4), 253–265 (1991)

    Article  MATH  Google Scholar 

  8. Treves, A.: Quantitative estimate of the information relayed by the Schaffer collaterals. J. Comp. Neuro. 2(3), 259–272 (1995)

    Article  MathSciNet  Google Scholar 

  9. Brun, V.H., Otnass, M.K., Molden, S., Steffenach, H.A., Witter, M.P., Moser, M.B., Moser, E.I.: Place cells and place recognition maintained by direct entorhinal-hippocampal circuitry. Science 296(5576), 2243–2246 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Longden, K. (2005). Recovery of Performance in a Partially Connected Associative Memory Network Through Coding. In: Duch, W., Kacprzyk, J., Oja, E., Zadrożny, S. (eds) Artificial Neural Networks: Biological Inspirations – ICANN 2005. ICANN 2005. Lecture Notes in Computer Science, vol 3696. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11550822_31

Download citation

  • DOI: https://doi.org/10.1007/11550822_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28752-0

  • Online ISBN: 978-3-540-28754-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics