Principal Interconnections in Higher Order Hebbian-Type Associative Memories

  • Authors:
  • Jung-Hua Wang

  • Affiliations:
  • -

  • Venue:
  • IEEE Transactions on Knowledge and Data Engineering
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

The existence of principal interconnections useful in solving the proliferation problem in higher order Hebbian-type associative memories is introduced. Among all legal interconnections, we prove 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$$\sqrt {m_s} \le \left| T \right| \le 2 \sqrt {m_s},$$where ms equals the number of stored codewords. Memories that use only Tpr can maintain original generalization performance, using less than 50 percent of the total number of interconnections.