PRINCIPAL INTERCONNECTIONS IN HIGHER-ORDER HEBBIAN-TYPE ASSOCIATIVE

Authors
WANG JW
Citation
Jw. Wang, PRINCIPAL INTERCONNECTIONS IN HIGHER-ORDER HEBBIAN-TYPE ASSOCIATIVE, IEEE transactions on knowledge and data engineering, 10(2), 1998, pp. 342-345
Citations number
8
Categorie Soggetti
Computer Science Artificial Intelligence","Computer Science Information Systems","Engineering, Eletrical & Electronic","Computer Science Artificial Intelligence","Computer Science Information Systems
Journal title
IEEE transactions on knowledge and data engineering → ACNP
ISSN journal
10414347
Volume
10
Issue
2
Year of publication
1998
Pages
342 - 345
Database
ISI
SICI code
1041-4347(1998)10:2<342:PIIHHA>2.0.ZU;2-4
Abstract
The existence of principal interconnections useful in solving the prol iferation problem in higher order Hebbian-type associative memories is introduced. Among all legal interconnections, we prove there exists a subset T-pr that carries more information than the others. Regardless of the network order p, the elements in T-pr are shown to be those in terconnections T that fall within the range of root m(s) less than or equal to \T\ less than or equal to 2 root m(s), where m(s) equals the number of stored codewords. Memories that use only T-pr can maintain o riginal generalization performance, using less than 50 percent of the total number of interconnections.