By Topic

Genetic sparse distributed memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. Das ; Dept. of Comput. Sci., Colorado State Univ., Fort Collins, CO, USA ; D. Whitley

Kanerva's `sparse distributed memory' (SDM) is a type of self-organizing neural network which is able to extract a statistical summary from large volumes of data as it is being processed online. Genetic algorithms have been used to optimize the `location address space' which corresponds to the mapping from the input layer to the hidden units in the neural network implementation of the sparse distributed memory. If treated as a global optimization problem, the genetic algorithm will attempt to optimize the sparse distributed memory so as to extract a single best statistical predictor. However, the real objective is to obtain not just a single global optimum, but to extract information about as many local optima as possible, since each local optimum in this particular definition of the search space represents a different and distinct data pattern that correlates with some output in which we may be interested. The implementation details of a genetic sparse distributed memory as well as modified algorithm designed to deal better with multiple data patterns are presented

Published in:

Combinations of Genetic Algorithms and Neural Networks, 1992., COGANN-92. International Workshop on

Date of Conference:

6 Jun 1992