Cart (Loading....) | Create Account
Close category search window
 

On fuzzy associative memory with multiple-rule storage capacity

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

2 Author(s)
Fu-lai Chung ; Dept. of Comput., Hong Kong Polytech., Kowloon, Hong Kong ; Tong Lee

Kosko's fuzzy associative memory (FAM) is the very first neural network model for implementing fuzzy systems. Despite its success in various applications, the model suffers from very low storage capacity, i.e., one rule per FAM matrix. A lot of hardware and computations are usually required to implement the model and, hence, it is limited to applications with small fuzzy rule-base. In this paper, the inherent property for storing multiple rules in a FAM matrix is identified. A theorem for perfect recalls of all the stored rules is established and based upon which the hardware and computation requirements of the FAM model can be reduced significantly. Furthermore, we have shown that when the FAM model is generalized to the one with max-bounded-product composition, single matrix implementation is possible if the rule-base is a set of semi-overlapped fuzzy rules. Rule modification schemes are also developed and the inference performance of the established high capacity models is reported through a numerical example

Published in:

Fuzzy Systems, IEEE Transactions on  (Volume:4 ,  Issue: 3 )

Date of Publication:

Aug 1996

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.