Using a genetic algorithm to investigate efficient connectivity in associative memories

Authors:
Rod Adams;Lee Calcraft;Neil Davey
Affiliations:
School of Computer Science, University of Hertfordshire, College Lane, Hatfield, Hertfordshire AL10 9AB, UK;School of Computer Science, University of Hertfordshire, College Lane, Hatfield, Hertfordshire AL10 9AB, UK;School of Computer Science, University of Hertfordshire, College Lane, Hatfield, Hertfordshire AL10 9AB, UK
Venue:
Neurocomputing
Year:
2009

Citing 1
Cited 2

Efficient architectures for sparsely-connected high capacity associative memory models

Connection Science

Sparsely connected autoassociative fuzzy implicative memories and their application for the reconstruction of large gray-scale images

Neurocomputing
An evolutionary network model of epileptic phenomena

Neurocomputing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We investigate sparse networks of threshold units, trained with the perceptron learning rule to act as associative memories. The units have position and are placed in a ring so that the wiring cost is a meaningful measure. A genetic algorithm is used to evolve networks that have efficient wiring, but also good functionality. It is shown that this is possible, and that the connection strategy used by the networks appears to maintain some connectivity at all distances, but with the probability of a connection decreasing rapidly with distance.