title: A Boolean Hebb rule for binary associative memory design.
abstract: A binary associative memory design procedure that gives a Hopfield network with a symmetric binary weight matrix is introduced in this paper. The proposed method is based on introducing the memory vectors as maximal independent sets to an undirected graph, which is constructed by Boolean operations analogous to the conventional Hebb rule. The parameters of the resulting network is then determined via the adjacency matrix of this graph in order to find a maximal independent set whose characteristic vector is close to the given distorted vector. We show that the method provides attractiveness for each memory vector and avoids spurious memories whenever the set of given memory vectors satisfy certain compatibility conditions, which implicitly imply sparsity. The applicability of the design method is finally investigated by a quantitative analysis of the compatibility conditions.
authors.affiliation: Computational Intelligence Laboratory, University of Louisville, Louisville KY 40292, USA. mkerem@ieee.org
authors.forename: Mehmet Kerem
authors.initials: MK
authors.lastname: Müezzinoğlu
authors.forename: Cüneyt
authors.initials: C
authors.lastname: Güzeliş
mesh_terms: D008568:Memory; D016571:Neural Networks, Computer