Skip to main content
SpringerLink
Log in

Extended Sparse Distributed Memory and Sequence Storage

  • Published:
Cognitive Computation Aims and scope Submit manuscript

Abstract

Sparse distributed memory (SDM) is an auto-associative memory system that stores high-dimensional Boolean vectors. SDM uses the same vector for the data (word) and the location where it is stored (address). Here, we present an extension of the original SDM that uses word vectors of larger size than address vectors. This extension preserves many of the desirable properties of the original SDM: auto-associability, content addressability, distributed storage and robustness over noisy inputs. In addition, it adds new functionality, enabling an efficient auto-associative storage of sequences of vectors, as well as of other data structures such as trees. Simulations testing this new memory are described.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Kanerva P. Sparse distributed memory. Cambridge: The MIT Press; 1988.

    Google Scholar 

  2. Baddeley AD, Conway M, Aggleton JP. Episodic memory. Oxford: Oxford University Press; 2001. p. 294.

    Google Scholar 

  3. Franklin S, et al. The role of consciousness in memory. Brains Minds Media. 2005;1:1–38.

    Google Scholar 

  4. Furber SB, et al. A sparse distributed memory based upon N-of-M codes. Neural Netw. 2004;17(10):1437–51.

    Article  PubMed  Google Scholar 

  5. Bose J, Furber SB, Shapiro JL. Spiking neural sparse distributed memory implementation for learning and predicting temporal sequences. Lect Notes Comput Sci. 3696/2005. p. 115–20; 2005.

  6. Meng H, et al. A modified sparse distributed memory model for extracting clean patterns from noisy inputs. In International joint conference on neural networks (IJCNN)2009. Atlanta, GA; 2009.

  7. Ramamurthy U, D’Mello SK, Franklin S. Realizing forgetting in a modified sparse distributed memory system. In: Schunn C, Lane S. editors. Proceedings of the 28th Annual Conference Of The Cognitive Science Society, Mahwah, NJ: Lawrence Erlbaum Associates; 2006. p. 1992–97.

  8. Ramamurthy U, Franklin S. Memory systems for cognitive agents. In Proceedings of human memory for artificial agents symposium at the artificial intelligence and simulation of behavior convention (AISB’11)2011. UK: University of York; 2011. p. 35–40.

  9. D’Mello SK, Ramamurthy U, Franklin S. Encoding and retrieval efficiency of episodic data in a modified sparse distributed memory system. In: Proceedings of the 27th annual meeting of the cognitive science society. Stresa, Italy; 2005.

  10. Ramamurthy U, D’Mello SK, Franklin S. modified sparse distributed memory as transient episodic memory for cognitive software agents. In: Proceedings of the international conference on systems, man and cybernetics 2004. Piscataway: IEEE; 2004.

  11. Snaider J, McCall R, Franklin S. Time production and representation in a conceptual and computational cognitive model. Cogn Syst Res. 2012;13(1):59–71.

    Article  Google Scholar 

  12. Sun R, Giles CL. Sequence learning: from recognition and prediction to sequential decision making. IEEE Intell Syst. 2001;16(4):67–70.

    Article  Google Scholar 

  13. Kurby CA, Zacks JM. Segmentation in the perception and memory of events. Trends Cogn Sci. 2008;12(2):72–9.

    Article  PubMed  Google Scholar 

  14. Kanerva P. Hyperdimensional computing: an introduction to computing in distributed representation with high-dimensional random vectors. Cognit Comput. 2009;1(2):139–59.

    Article  Google Scholar 

  15. Snaider J, Franklin S. Extended sparse distributed memory. In: Biological inspired cognitive architectures 2011. Washington; 2011.

  16. Franklin S. Artificial minds. Cambridge: MIT Press; 1995.

    Google Scholar 

  17. Ratitch B, Precup D. Sparse distributed memories for on-line value-based reinforcement learning. Lect Notes Comput Sci. 2004;3201:347–58.

    Article  Google Scholar 

  18. Fan KC, Wang YK. A genetic sparse distributed memory approach to the application of handwritten character recognition. Pattern Recogn Lett. 1997;30(12):2015–22.

    Google Scholar 

  19. Anwar A, Dasgupta D, Franklin S. Using genetic algorithms for sparse distributed memory initialization. In: International conference genetic and evolutionary computation (GECCO); 1999.

  20. Jaeckel LA, An alternative design for a sparse distributed memory. Research Institute for Advanced Computer Science, NASA Ames Research Center; 1989.

  21. Jaeckel LA, A class of designs for a sparse distributed memory, Research Institute for Advanced Computer Science, NASA Ames Research Center; 1989.

  22. Karlsson R. A fast activation mechanism for the Kanerva SDM memory. In: Proceedings of the RWC symposium. p. 69–0; 1995.

  23. Kanerva P. Sparse distributed memory and related models, in associative neural memories: theory and implementation, Hassoun MH, editor. New York: Oxford University Press; 1993. p. 50–76.

  24. Chou PA. The capacity of the Kanerva associative memory. IEEE Trans Inf Theory. 1989;35(2):281–98.

    Article  Google Scholar 

  25. Keeler JD. Comparison between Kanerva’s SDM and Hopfield-type neural networks. Cognitive Sci. 1988;12:299–329.

    Article  Google Scholar 

  26. Willshaw DJ. Holography, associative memory, and inductive generalization. In: Hinton GE, Anderson JA, editors. In parallel models of associative memory. Hillsdale: Erlbaum; 1981. p. 83–104.

    Google Scholar 

  27. Knoblauch A, Palm G, Sommer FT. Memory capacities for synaptic and structural plasticity. Neural Comput. 2010;22(2):289–341.

    Article  PubMed  Google Scholar 

  28. Lawrence M, Trappenberg T, Fine A. Rapid learning and robust recall of long sequences in modular associator networks. Neurocomputing. 2006;69(7–9):634–41.

    Article  Google Scholar 

  29. Wang D, Yuwono B. Incremental learning of complex temporal patterns. IEEE Trans Neural Netw. 1995;7:1465–81.

    Article  Google Scholar 

  30. Stringer SM, et al. Selforganizing continuous attractor networks and motor function. Neural Netw. 2003;16(2):161–82.

    Article  PubMed  CAS  Google Scholar 

  31. Maurer A, Hersch M, Billard AG. Extended hopfield network for sequence learning: application to gesture recognition. In: Proceedings of the ICANN 2005; 2005.

Download references

Author information

Authors and Affiliations

  1. Computer Science Department and Institute for Intelligent Systems, The University of Memphis, FedEx Institute of Technology, 365 Innovation Dr., Memphis, TN, 38152, USA

    Javier Snaider & Stan Franklin

Authors
  1. Javier Snaider
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stan Franklin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Javier Snaider.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Snaider, J., Franklin, S. Extended Sparse Distributed Memory and Sequence Storage. Cogn Comput 4, 172–180 (2012). https://doi.org/10.1007/s12559-012-9125-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12559-012-9125-8

Keywords

Search

Navigation