A new bidirectional heteroassociative memory encompassing correlational, competitive and topological properties.
In this paper, we present a new recurrent bidirectional model that encompasses correlational, competitive and topological model properties. The simultaneous use of many classes of network behaviors allows for the unsupervised learning/categorization of perceptual patterns (through input compression) and the concurrent encoding of proximities in a multidimensional space. All of these operations are achieved within a common learning operation, and using a single set of defining properties. It is shown that the model can learn categories by developing prototype representations strictly from exposition to specific exemplars. Moreover, because the model is recurrent, it can reconstruct perfect outputs from incomplete and noisy patterns. Empirical exploration of the model's properties and performance shows that its ability for adequate clustering stems from: (1) properly distributing connection weights, and (2) producing a weight space with a low dispersion level (or higher density). In addition, since the model uses a sparse representation (k-winners), the size of topological neighborhood can be fixed, and no longer requires a decrease through time as was the case with classic self-organizing feature maps. Since the model's learning and transmission parameters are independent from learning trials, the model can develop stable fixed points in a constrained topological architecture, while being flexible enough to learn novel patterns.
Chartier
Sylvain
S
University of Ottawa, School of Psychology, 200 Lees E217, 125 University Street, Ottawa, ON K1N 6N5, Canada. sylvain.chartier@uottawa.ca
Giguère
Gyslain
G
Langlois
Dominic
D
D000465:Algorithms; D001185:Artificial Intelligence; D002965:Classification; D016000:Cluster Analysis; D003198:Computer Simulation; D006801:Humans; D007858:Learning; D008568:Memory; D011939:Mental Recall; D016571:Neural Networks, Computer