Storage (memory)

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Storage in human memory is one of three core process of memory, along with recall and encoding. It refers to the retention of information, which has been achieved through the encoding process, in the brain for a prolonged period of time until it is accessed through recall. Modern memory psychology differentiates the two distinct type of memory storage: short-term memory and long-term memory. In addition, different memory models have suggested variations of existing short-term and long-term memory to account for different ways of storing memory.

Types of memory storage[edit]

Short-term memory[edit]

Main article: Short-term memory

The short-term memory refers to the ability to hold information from immediate past for a short duration of time.[1] According to the Atkinson-Shiffrin Model of Memory,[2] in the process of Encoding, perceived memory[clarification needed] enters the brain and can be quickly forgotten if the sensory information is not stored further in the short-term memory. The information is readily accessible in the short-term memory for only a short time. Baddeley suggested that memory stored in short-term memory is continuously deteriorating, which can eventually lead to forgetting in the absence of rehearsal.[3] George A. Miller suggested in his paper that the capacity of the short-term memory storage is approximately seven items, plus or minus two,[4] but modern researchers are showing that this itself is subject to numerous variability, including the stored items’ phonological properties.[5]

Long-term memory[edit]

Main article: Long-term memory

In contrast to the short-term memory, long-term memory refers to the ability to hold information for a prolonged period of time. The Atkinson-Shiffrin Model of Memory (Atkinson 1968) suggests that the item stored in short-term memory moves to Long-Term Memory through repeated practice and use. Miller (1956), while suggesting limited capacity for short-term memory, suggested that the capacity of long-term memory is much greater than that of short-term memory; such have led to development of models that assume long-term memory is capable of unlimited memory. The duration of long-term memory, on the other hand, is not permanent; unless memory is occasionally recalled, which, according to the Dual-Store Memory Search Model, enhances the long-term memory, the memory may be failed to recall on later occasions.

Models of memory storage[edit]

Varieties of different memory models have been proposed to account for different types of recall processes, including cued recall, free recall, and serial recall. In order to explain the recall process, however, the memory model must identify how an encoded memory can reside in the memory storage for a prolonged period of time until the memory is accessed again, during the recall process. Not all models, however, use the terminology of short-term and long-term memory to explain memory storage; the Dual-Store theory and refined version of Atkinson-Shiffrin Model of Memory (Atkinson 1968) uses both short-term and long-term memory storage, but others do not.

Multi-Trace Distributed Memory Model[edit]

The multi-trace distributed memory model suggests that the memories that are being encoded are converted to vectors of values, with each scalar quantity of a vector representing a different attribute of the item to be encoded. Such notion was first suggested by early theories of Hooke (1969) and Semon (1923). A single memory is distributed to multiple attributes, or features, so that each attribute represents one aspect of the memory being encoded. Such vector of values is then added into the memory array or a matrix, composed of different traces or vectors of memory.

Therefore, every time a new memory is encoded, such memory is converted to a vector or a trace, composed of scalar quantities representing variety of attributes, which is then added to pre-existing and ever-growing memory matrix, composed of multiple traces – hence the name of the model.

Once memory traces corresponding to specific memory are stored in the matrix, in order to retrieve the memory for the recall process, one must cue the memory matrix with a specific probe, which would be used to calculate the similarity between the test vector and the vectors stored in the memory matrix. As the memory matrix is constantly growing with new traces being added in, one would have to perform a parallel search through all the traces present within the memory matrix in order to calculate the similarity, whose result can be used to perform either associative recognition, or with probabilistic choice rule, used to perform a cued recall.

While it has been said that human memory seems to be capable of storing a great amount of information, to the extent that some had thought an infinite amount, the presence of such ever-growing matrix within human memory sounds implausible. In addition, the model suggests that in order to perform the recall process, parallel-search between every single trace that resides within the ever-growing matrix is required, which also raises doubt on whether such computations can be done in a short amount of time. Such doubts, however, have been challenged by findings of Gallistel and King[6] who present evidence on the brain’s enormous computational abilities that can be in support of such parallel support.

Neural Network Models[edit]

Main article: Hopfield network

Multi-Trace model had two key limitations: one, notion of the presence of ever-growing matrix within human memory sounds implausible, and two, computational searches for similarity against millions of traces that would be present within memory matrix to calculate similarity sounds far beyond the scope of the human recalling process. The neural network model is the ideal model in this case, as it overcomes the limitations posed by the multi-trace model and maintains the useful features of the model as well.

The Neural Network model assumes that ‘neurons’ in a neural network form a complex network with other neurons, forming a highly interconnected network; each neuron is characterized by the activation value, and the connection between two neurons is characterized by the weight value. Interaction between each neuron is characterized by the McCullough-Pitts Dynamical Rule,[7] and change of weight and connections between neurons resulting from learning is represented by the Hebbian Learning Rule.[8][9]

Anderson[10] shows that combination of Hebbian Learning rule and McCullough-Pitts Dynamical rule allow network to generate a weight matrix that can store associations between different memory patterns – such matrix is the form of memory storage for the Neural Network Model. Major differences between the matrix of multiple traces hypothesis and the neural network model is that while new memory indicates extension of the existing matrix for the multiple traces hypothesis, weight matrix of the neural network model does not extend; rather, the weight is said to be updated with introduction of new association between neurons.

Using the weight matrix and Learning / Dynamic rule, neurons cued with one value can retrieve the different value that is ideally a close approximation of the desired target memory vector.

As the Anderson’s weight matrix between neurons will only retrieve the approximation of the target item when cued, modified version of the model was sought in order to be able to recall the exact target memory when cued. The Hopfield Net[11] is currently the simplest and most popular neural network model of associative memory; the model allows the recall of clear target vector when cued with the part or the ‘noisy’ version of the vector.

The weight matrix of Hopfield Net, that stores the memory, closely resembles the one used in weight matrix proposed by Anderson. Again, when new association is introduced, the weight matrix is said to be ‘updated’ to accommodate the introduction of new memory; it is stored until the matrix is cued by a different vector.

Dual-Store Memory Search Model[edit]

First developed by Atkinson and Shiffrin (1968), and refined by others, including Raajimakers and Shiffrin,[12] the Dual-store Memory Search model, now referred to as SAM or Search of Associative Memory model, remains as one of the most influential computational models of memory [8]. The model utilizes both Short-Term memory, termed Short-Term Store (STS), and Long-Term Memory, termed Long-Term Store (LTS) or Episodic Matrix, in its mechanism.

When an item is first encoded, it is introduced into the Short-Term Store. While the item stays in the Short-Term Store, vector representations in Long-Term store go through a variety of associations. Items introduced in Short-Term Store go through three different types of association: autoassociation, the self-association in Long-Term Store, Heteroassociation, the inter-item association in Long-Term Store, and the Context Association, which refers to association between the item and its encoded context. For each item in Short-Term Store, the longer the duration of time an item resides within the Short-Term Store, the greater its association with itself will be with other items that co-reside within Short-Term store, and with its encoded context.

The size of the Short-Term store is defined by a parameter, r. As an item is introduced into the Short-Term Store, and if the Short-Term store has already been occupied by a maximum number of items, the item will probably drop out of the Short-Term Storage.[13]

As items co-reside in the short-term store, their associations are constantly being updated in the Long-term store matrix. The strength of association between two items depends on the amount of time the two memory items spend together within the short-term store, known as the contiguity effect. Two items that are contiguous have greater associative strength and are often recalled together from Long-Term Storage.

Furthermore, Primacy effect, an effect seen in memory recall paradigm, reveals that the first few items in a list have a greater chance of being recalled over others in the STS, while older items have a greater chance of dropping out of STS. The item that managed to stay in the STS for an extended amount of time would have formed a stronger autoassociation, heteroassociation and context association than others, ultimately leading to greater associative strength and a higher chance of being recalled.

Recency effect of recall experiments is when the last few items in a list are recalled exceptionally well over other items, and can be explained by the Short-Term Store. When the study of a given list of memory has been finished, what resides in the Short-Term store in the end would be the last few items that were introduced last. Because Short-Term store is readily accessible, such items would be recalled before any item stored within long-term store. This recall accessibility also explains the fragile nature of Recency Effect, which is that the simplest distractors can cause a person to forget the last few items in the list, as the last items would not have had enough time to form any meaningful association within the Long-Term Store. If the information is dropped out of the Short-Term store by distractors, the probability of the last items being recalled would be expected to be lower than even the pre-recency items in the middle of the list.

The Dual-Store SAM model also utilizes memory storage, which itself can be classified as a type of long-term storage: the Semantic Matrix. The Long-Term store in SAM represents the episodic memory, which only deals with new associations that were formed during the study of an experimental list; pre-existing associations between items of the list, then, need to be represented on different matrix, the Semantic matrix. The semantic matrix remains as the another source of information that is not modified by episodic associations that are formed during the exam.[14]

Thus, the two types of memory storage, Short-Term Store and Long-Term Store, are utilized in the SAM model. In the recall process, items residing in Short-Term memory store will be recalled first, followed by items residing in Long-Term Store, where the probability of being recalled is proportional to the strength of the association present within the long-term store. Another Memory storage, the Semantic Matrix, is used to explain the semantic effect associated with memory recall.

See also[edit]

References[edit]

  1. ^ Kumaran, D. (Apr 2008). "Short-Term Memory and the Human Hippocampus". Journal of Neuroscience 28 (15): 3837–3838. doi:10.1523/JNEUROSCI.0046-08.2008. 
  2. ^ Atkinson, R.C.; Shiffrin (1968). "Chapter: Human memory: A proposed system and its control processes". The psychology of learning and motivation 2: 89–195. doi:10.1016/s0079-7421(08)60422-3. 
  3. ^ Baddeley, A.D. (1974). "The psychology of learning and motivation: Advances in research and theory". Working memory 8: 47–89. doi:10.1016/s0079-7421(08)60452-1. 
  4. ^ Millar, A.G. (1956). "The Magical Number Seven, Plus or Minus Two: Some Limits on Our Capacity for Processing Information". Psychological Review 101 (2): 343–35. doi:10.1037/0033-295X.101.2.343. PMID 8022966. 
  5. ^ Baddeley, A.D. (November 1966). "Short-term memory for word sequences as a function of acoustic, semantic and formal similarity". Quarterly Journal of Experimental Psychology 18 (4): 362–5. doi:10.1080/14640746608400055. PMID 5956080. 
  6. ^ Gallistel, C.R.; King (2009). "Memory and the computational brain: why cognitive science will transform neuroscience". Wiley-Blackwell. 
  7. ^ McCullough, W.S.; Pitts (1943). "A logical calculus of the ideas immanent in nervous activity.". Bulletin of Mathematical Biophysics 5: 115–133. doi:10.1007/BF02478259. 
  8. ^ Hebb, D.O. (1949). Organization of Behavior. 
  9. ^ Moscovitch, M. (2006). "The cognitive neuroscience of remote episodic, semantic and spatial memory". Current Opinion in Neurobiology 16 (2): 179–190. doi:10.1016/j.conb.2006.03.013. PMID 16564688. 
  10. ^ Anderson, J.A. (1970). "Two Models for Memory Organization using Interacting Traces". Mathematical Biosciences 8: 137–160. doi:10.1016/0025-5564(70)90147-1. 
  11. ^ Hopfield, J.J. (1982). "Neural Networks and Physical Systems with Emergent Collective Computational Abilities". Proceedings of the National Academy of Sciences 79: 2554–2558. doi:10.1073/pnas.79.8.2554. PMC 346238. PMID 6953413. 
  12. ^ Raaijmakers, J.G.; Shiffrin (1981). "Search of associative memory". Psychological Review 8 (2): 98–134. doi:10.1037/0033-295X.88.2.93. 
  13. ^ Philips, J.L.; Shriffin (1967). "The effects of List Length on Short-Term Memory". Journal of Verbal Learning and Verbal Behavior 6: 303–311. 
  14. ^ Nelson, D.L.; McKinney (1998). "Interpreting the Influence of Implicitly activated memories on recall and recognition". Psychological Review 105 (2): 299–324. doi:10.1037/0033-295x.105.2.299. PMID 9577240.