Skip Navigation

The Computer Journal 1993 36(6):554-561; doi:10.1093/comjnl/36.6.554
© 1993 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chao, D. Y.
Right arrow Articles by Hung, D. D. C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Convergence Time and Memory Capacity of Higher-order Hopfield Associative Memory with Multi-valued Neurons

D. Y. Chao *, D. T. Wang * and D. D. C. Hung *

Institute for Integrated Systems, Computer and Information Science Department, New Jersey Institute of Technology, Newark, NJ 07102, USA

We investigate the two basic properties, i.e. convergence time and memory capacity, of the higher-order Hopfield associate memory with multi-valued neurons. The second-order Hopfield neural network of multi-valued neurons is presented analytically. The properties of the combined higher-order multi-valued model is then studied. Finally, the memory capacity of the higher-higher order binary-valued model is studied using a statistical approach.


* Institute for Integrated Systems, Computer and Information Science Department, New Jersey Institute of Technology, Newark, NJ 07102, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.