Associative memories

1. Store a set u of patterns Su

2. Apply an input X

3. Networks finds the closest match

• Minimizes the Hamming distance between X and S

• Goal: A network, with weights wij, to solve this problem

Previous slide

Next slide

Back to first slide

View graphic version