• DocumentCode
    296150
  • Title

    Associative storage of complex sequences in recurrent neural networks

  • Author

    Athithan, G.

  • Author_Institution
    Adv. Numerical Res. & Anal. Group, Defence Res. & Dev. Organ., Hyderabad, India
  • Volume
    4
  • fYear
    1995
  • fDate
    Nov/Dec 1995
  • Firstpage
    1971
  • Abstract
    The problem of modelling storage and associative recall of complex sequences in recurrent neural networks is defined in the context of human memory. A linear model and a learning rule based on Hebb´s principle are reviewed. Two additional rules, one based on an iterative approach and the other based on linear programming, are presented. The performances of these three rules in terms of their storage capacity and noise tolerance during recall are compared by means of numerical simulations. Using a Monte-Carlo technique, the fractional volume of tubes of attraction around stored complex sequences is computed for each rule. Enhancements to the linear model and possible directions for future work conclude the paper
  • Keywords
    Hebbian learning; Monte Carlo methods; content-addressable storage; iterative methods; linear programming; recurrent neural nets; Hebb´s principle; Monte-Carlo technique; associative recall; associative storage; complex sequences; iterative approach; learning rule; linear model; linear programming; noise tolerance; recurrent neural networks; storage capacity; Associative memory; Biological system modeling; Content addressable storage; Delay lines; Humans; Intelligent networks; Linear programming; Neural networks; Neurons; Recurrent neural networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 1995. Proceedings., IEEE International Conference on
  • Conference_Location
    Perth, WA
  • Print_ISBN
    0-7803-2768-3
  • Type

    conf

  • DOI
    10.1109/ICNN.1995.488973
  • Filename
    488973