✦ LIBER ✦

Iterative retrieval of sparsely coded associative memory patterns

✍ Scribed by F. Schwenker; F.T. Sommer; G. Palm

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 961 KB
Volume: 9
Category: Article
ISSN: 0893-6080
DOI: 10.1016/0893-6080(95)00112-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient retrieval from sparse associat

Efficient retrieval from sparse associative memory

✍ Ronald L. Greene 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 816 KB

Best-match retrieval of data from memory which is sparse in feature space is a timeconsuming process for sequential machines. Previous work on this problem has shown that a connectionist network used as a hashing function can allow faster-than-linear probabilistic retrieval from such memory when pre

Associative memory with a sparse encodin

Associative memory with a sparse encoding mechanism for storing correlated patterns

✍ Makoto Hirahara; Natsuki Oka; Toshiki Kindo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 864 KB

Gu(freund (Neural networks with hierarchically correlated patterns. Physical Review A, 37, 570-577, 1988 ) has proposed a model for storing hierarchically correlated patterns where ancestor patterns are correlated with descendant ones. However, there is a problem of small storage capacity. Furtherm

Sparse distributed memory using N-of-M c

Sparse distributed memory using N-of-M codes

✍ Steve B. Furber; W. John Bainbridge; J. Mike Cumpstey; Steve Temple 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Neural correlates of strategic memory re

Neural correlates of strategic memory retrieval: Differentiating between spatial-associative and temporal-associative strategies

✍ Mischa de Rover; Karl Magnus Petersson; Sieberen P. van der Werf; Alexander R. C 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 641 KB

## Abstract Remembering complex, multidimensional information typically requires strategic memory retrieval, during which information is structured, for instance by spatial‐ or temporal associations. Although brain regions involved in strategic memory retrieval in general have been identified, diff

Improved bidirectional retrieval of spar

Improved bidirectional retrieval of sparse patterns stored by Hebbian learning

✍ Friedrich T. Sommer; Günther Palm 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 288 KB

The Willshaw model is asymptotically the most efficient neural associative memory (NAM), but its finite version is hampered by high retrieval errors. Iterative retrieval has been proposed in a large number of different models to improve performance in auto-association tasks. In this paper, bidirecti

Retrieval process of an associative memo

Retrieval process of an associative memory with a general input-output function

✍ Hidetoshi Nishimori; Ioan Opriş 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 621 KB

The retrieval process ofan associative memory with a general input-output function is studied by means 0/a signal-to-noise ratio analysis. We derive a set 0/ recursion relations for macroscopic variables to describe the time development ofthe network. By taking the equilibrium limit ofthe recursion