By Topic

Design of the fully connected binary neural network via linear programming

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

3 Author(s)
Kam, Moshe ; ECE Dept., Drexel Univ., Philadelphia, PA, USA ; Chow, J.-C. ; Fischl, Robert

An attempt is made to develop an alternative to the Hebbian-hypothesis-based design, using a powerful linear-programming (LP)-based algorithm. The LP-based algorithm attempts to build around each pattern to be stored a ball with a prespecified radius (in the Hamming distance sense) which is the ball of convergence for the pattern: when the network starts as one of the states in the ball, it will eventually converge to the central pattern. The Hopfield model and the sum-of-outer-products (SOOP) design are presented. Calculations are made of the radius of the balls of convergence for any given design. The LP-based algorithm is developed, and examples are presented demonstrating the advantages accrued for the network's retrieval capability through the LP algorithm

Published in:

Circuits and Systems, 1990., IEEE International Symposium on

Date of Conference:

1-3 May 1990