Close category search window
 

Memory capacity of artificial neural networks with high order node connections

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
$31 $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)
Bak, C.S. ; Hughes Res. Lab., Malibu, CA, USA ; Little, M.J.

The authors have undertaken to understand and quantify the performance of artificial neural networks in the simpler and more restricted domain of associative memory. They have constructed models of artificial neural networks based on several different node-to-node interconnection schemes. The authors have simulated these models and quantified their performance as associative memories. The storage capacity, as determined by the retrieval accuracy, has shown large increases with the higher-order node-to-node connection models. The storage capacity of a four-node connection model (the output of each quartet of nodes is input to every other node) is 46 times larger than a conventional two-node (i.e. Hopfield) model with the same number of nodes.<>

Published in:
Neural Networks, 1988., IEEE International Conference on

Date of Conference: 24-27 July 1988

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.