1995
DOI: 10.3758/bf03197264
|View full text |Cite
|
Sign up to set email alerts
|

Developing TODAM: Three models for serial-order information

Abstract: TODAM2, a theory of distributed associative memory, shows how item and associative information can be considered special cases of serial-order information. Consequently, it is important to get the right model for serial-order information. Here, we analyze and compare three distributedmemory models for serial-order information that use TODAM'sconvolution-correlation formalism. These models are the chaining model, the chunking model, and a new model, the power-set model. The chaining model associates each item w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

4
111
0

Year Published

1998
1998
2002
2002

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 109 publications
(115 citation statements)
references
References 39 publications
4
111
0
Order By: Relevance
“…Note that the idea of start and end markers is not new: Such markers are assumed in both the model of Shiffrin and Cook (1978) and TODAM (e.g., Lewandowsky & Murdock, 1989;Murdock, 1995). It is the use of these markers to code position that is new.…”
Section: Notesmentioning
confidence: 99%
“…Note that the idea of start and end markers is not new: Such markers are assumed in both the model of Shiffrin and Cook (1978) and TODAM (e.g., Lewandowsky & Murdock, 1989;Murdock, 1995). It is the use of these markers to code position that is new.…”
Section: Notesmentioning
confidence: 99%
“…When both distributed representations and distributed storage are utilized (e.g., Lewandowsky & Murdock, 1989), as is the case with a number of PDP, connectionist, or neural net models, items lose their identity at storage, Retrieval processes produce a noisy trace that needs to be cleaned up. This cleanup process is often accomplished by an autoassociative neural net in which the net attempts to "build" an item from the trace (Chappell & Humphreys, 1994;Lewandowsky & Li, 1994;Murdock, 1995). Autoassociators of the Chappell and Humphreys type converge on the pattern that represents a target item by either activating missing features or suppressing activated features that do not belong to the target item.…”
mentioning
confidence: 99%
“…Each of these varieties of computational models has been applied to sequential learning and memory problems at one time or another. For example, "random walk" models have been advanced by Roitblat (1984) and, recently, Capaldi (e.g., Neath & Capaldi, 1996); connectionist models have been advanced by Murdock (1995a), among others; and a forerunner of production system models was pioneered on serialpattern learning problems studied in humans by Simon, Newell, and their associates (Newell & Simon, 1961;Simon & Kotovsky, 1963). The principal concern was that the model should have characteristics of simple associative systems.…”
Section: Sequential Learning Viewed As Discrimination Learningmentioning
confidence: 99%
“…In particular, the models developed by Murdock and Metcalfe (TODAM and CHARM, respectively;Eich, 1982;Metcalfe, 1990;Murdock, 1982Murdock, , 1983) have these properties. These models have the added advantage that both Murdock's and Metcalfe's models have also been used successfully to simulate a broad array of human associative-learning and memory phenomena (Metcalfe, 1990(Metcalfe, , 1993Murdock, 1982Murdock, , 1983, including some rote sequential-learning phenomena (Murdock, 1983(Murdock, , 1992(Murdock, , 1995a.…”
Section: Sequential Learning Viewed As Discrimination Learningmentioning
confidence: 99%