Generalized encoding and decoding operators for lattice-based associative memories.
During the 1990s Ritter, introduced a new family of associative memories based on lattice algebra instead of linear algebra. These memories provide unlimited storage capacity, unlike linear-correlation-based models. The canonical lattice-based memories, however, are susceptible to noise in the initial input data. In this brief, we present novel methods of encoding and decoding lattice-based memories using two families of ordered weighted average (OWA) operators. The result is a greater robustness to distortion in the initial input data, and a greater understanding of the effect of the choice of encoding and decoding operators on the behavior of the system, with the tradeoff that the time complexity for encoding is increased.
McElroy
John
J
Computer and Information Science and Engineering Department, University of Florida, Gainesville, FL 32611, USA. john@johnmcelroy.com
Gader
Paul
P
D000465:Algorithms; D001245:Association Learning; D032701:Biomimetics / Q000379:methods*; D003198:Computer Simulation; D005246:Feedback; D016247:Information Storage and Retrieval / Q000379:methods*; D008962:Models, Theoretical; D016571:Neural Networks, Computer