✦ LIBER ✦

Improving recall from an associative memory

✍ Scribed by Bruce Graham; David Willshaw

Publisher: Springer-Verlag
Year: 1995
Tongue: English
Weight: 945 KB
Volume: 72
Category: Article
ISSN: 0340-1200
DOI: 10.1007/bf00202789

No coin nor oath required. For personal study only.

✦ Synopsis

The associative net as a model of biological associative memory is investigated. Calculating the output pattern retrieved from a partially connected associative net presented with noisy input cues involves several computations. This is complicated by variations in the dendritic sums of the output units due to errors in the cue and differences in input activity and unit usage. The possible implementation of these computations by biological neural machinery is unclear. We demonstrate that a relatively simple transformation can reduce variation in the dendritic sums. This leads to a winners-take-all type of strategy that produces increased recall performance which is equivalent to the more complicated optimal strategy proposed by others. We describe in detail the possible biological implications of our strategies, the novel feature of which ascribes a role to the NMDA and non-NMDA channels found in hippocampal pyramidal cells.

📜 SIMILAR VOLUMES

Recall of associated memories

✍ I. Nebenzahl 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 435 KB

A mechanism of serial association in the brain is discussed. The passage from one state to another is assumed to be effected by a control operated by the thalamus on the cortex. Memory failure mechanisms are discussed, such as insufficient imprint, as well as Freudian failure phenomena.

Operation of an associative memory

✍ M.R. Sayeh; R. Athinarayanan; M.R. Zargham 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Improved dream recall associated with me

Improved dream recall associated with meditation

✍ Henry Reed 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 587 KB

On optimal associative recall by an inco

On optimal associative recall by an incomplete key

✍ K. Murakami; S. Akaishi; T. Aibara 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 218 KB

Extension from a linear associative memo

Extension from a linear associative memory to a linguistic linear associative memory

✍ A. Blanco; M. Delgado; W. Fajardo 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 291 KB

## Ẃe present a linguistic extension from a crisp model by using a codification model that allows us to implement a fuzzy system on a discrete decision model. The paper begins with an introduction to the representation of fuzzy information, followed by a discussion of the codification method and t

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