A discrete fully recurrent network of max product units for associative memory and classification.
This paper defines the truncated normalized max product operation for the transformation of states of a network and provides a method for solving a set of equations based on this operation. The operation serves as the transformation for the set of fully connected units in a recurrent network that otherwise might consist of linear threshold units. Component values of the state vector and outputs of the units take on the values in the set [0, 0.1,..., 0.9, 1]. The result is a much larger state space given a particular number of units and size of connection matrix than for a network based on threshold units. Since the operation defined here can form the basis of transformations in a recurrent network with a finite number of states, fixed points or cycles are possible and the network based on this operation for transformations can be used as an associative memory or pattern classifier with fixed points taking on the role of prototypes. Discrete fully recurrent networks have proven themselves to be very useful as associative memories and as classifiers. However they are often based on units that have binary states. The effect of this is that the data to be processed consisting of vectors in R(n) have to be converted to vectors in [0, 1]m with m much larger than n since binary encoding based on positional notation is not feasible. This implies a large increase in the number of components. The effect can be lessened by allowing more states for each unit in our network. The network proposed demonstrates those properties that are desirable in an associative memory very well as the simulations show.
Brouwer
Roelof K
RK
Department of Computing Science, University College of the Cariboo, Kamloops British Columbia, Canada V2C 5 N3, Canada. rkbrouwer@ieee.org
D000465:Algorithms; D001185:Artificial Intelligence; D001244:Association; D017143:Fuzzy Logic; D008568:Memory / Q000502:physiology; D016571:Neural Networks, Computer