Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

PDF

California Polytechnic State University, San Luis Obispo

1998

Associative memory; Information storage capacity; Incomplete interconnectivity; Hetero-association; Auto-association; Hebbian learning; Retrieval strategy; Sparse coding.

Articles 1 - 1 of 1

Full-Text Articles in Physical Sciences and Mathematics

Information Storage Capacity Of Incompletely Connected Associative Memories, Holger Bosch, Franz J. Kurfess Jul 1998

Information Storage Capacity Of Incompletely Connected Associative Memories, Holger Bosch, Franz J. Kurfess

Computer Science and Software Engineering

In this paper, the memory capacity of incompletely connected associative memories is investigated. First, the capacity is derived for memories with fixed parameters. Optimization of the parameters yields a maximum capacity between 0.53 and 0.69 for hetero-association and half of it for auto-association improving previously reported results. The maximum capacity grows with increasing connectivity of the memory and requires sparse input and output patterns. Further, parameters can be chosen in such a way that the information content per pattern asymptotically approaches 1 with growing size of the memory.