By Topic

Principal interconnections in higher order Hebbian-type associative memories

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

1 Author(s)
Jung-Hua Wang ; Dept. of Electr. Eng., Nat. Taiwan Ocean Univ., Keelung

The existence of principal interconnections useful in solving the proliferation problem in higher order Hebbian-type associative memories is introduced. Among all legal interconnections, the author proves there exists a subset Tpr that carries more information than the others. Regardless of the network order p, the elements in Tpr are shown to be those interconnections T that fall within the range of √m, ⩽|T|⩽2√m, where ms equals the number of stored code words. Memories that use only Tpr can maintain original generalization performance, using less than 50 percent of the total number of interconnections

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:10 ,  Issue: 2 )