• DocumentCode
    1905485
  • Title

    The hybrid Hopfield-clique memory with perfect storage

  • Author

    Ueberla, Joerg ; Jagota, Arun

  • Author_Institution
    Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada
  • fYear
    1993
  • fDate
    1993
  • Firstpage
    895
  • Abstract
    A new model for associative memory, the hybrid Hopfield-clique network (HHcN) is proposed. It is based on Jagota´s Hopfield-clique network (HcN) and addresses its main problem, i.e., the existence of spurious memories. A new characterization of spurious memories based on graph theory is introduced. Given this characterization, it is possible to detect whether spurious memories are created. Once they are detected HHcN avoids them by creating new nodes in the network. The HHcN thus ensures perfect storage and recall for any arbitrary size collection of memories, and is space- and time-efficient on sparse ones (such as word-dictionaries). Experiments establish that the network sizes required to achieve perfect storage remain reasonably small
  • Keywords
    Hopfield neural nets; content-addressable storage; graph theory; Jagota´s Hopfield-clique network; graph theory; hybrid Hopfield-clique memory; perfect storage; space-efficient; spurious memories; time-efficient; word-dictionaries; Associative memory; Computer networks; Computer science; Graph theory; Neural networks; Samarium; Tin;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 1993., IEEE International Conference on
  • Conference_Location
    San Francisco, CA
  • Print_ISBN
    0-7803-0999-5
  • Type

    conf

  • DOI
    10.1109/ICNN.1993.298676
  • Filename
    298676