Bidirectional associative memory

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

Bidirectional associative memory (BAM) is a type of recurrent neural network. BAM was introduced by Bart Kosko in 1988.[1] There are two types of associative memory, auto-associative and hetero-associative. BAM is hetero-associative, meaning given a pattern it can return another pattern which is potentially of a different size. It is similar to the Hopfield network in that they are both forms of associative memory. However, Hopfield nets return patterns of the same size.

Topology[edit]

A BAM contains two layers of neurons, which we shall denote X and Y. Layers X and Y are fully connected to each other. Once the weights have been established, input into layer X presents the pattern in layer Y, and vice versa.

Procedure[edit]

Learning[edit]

Imagine we wish to store two associations, A1:B1 and A2:B2.

  • A1 = (1, 0, 1, 0, 1, 0), B1 = (1, 1, 0, 0)
  • A2 = (1, 1, 1, 0, 0, 0), B2 = (1, 0, 1, 0)

These are then transformed into the bipolar forms:

  • X1 = (1, -1, 1, -1, 1, -1), Y1 = (1, 1, -1, -1)
  • X2 = (1, 1, 1, -1, -1, -1), Y2 = (1, -1, 1, -1)

From there, we calculate M = \sum{{}^t \! X_i Y_i} where {}^t \! X_i denotes the transpose. So,

M = \left[ {\begin{array}{*{10}c}
   2 & 0 & 0 & -2  \\
   0 & -2 & 2 & 0  \\
   2 & 0 & 0 & -2  \\
   -2 & 0 & 0 & 2  \\
   0 & 2 & -2 & 0  \\
   -2 & 0 & 0 & 2  \\
 \end{array} } \right]

Recall[edit]

To retrieve the association A1, we multiply it by M to get (4, 2, -2, -4), which, when run through a threshold, yields (1, 1, 0, 0), which is B1. To find the reverse association, multiply this by the transpose of M.

See also[edit]

References[edit]

External links[edit]