Referenced Items are not available for this document.
In this paper, we present a formal derivation of general nonsingleton fuzzy logic systems (NSFLSs) and show how they can be efficiently computed. We give examples for special cases of membership functions and inference and we show how an NSFLS can be expressed as a “nonsingleton fuzzy basis function” expansion and present an analytical comparison of the nonsingleton and singleton fuzzy logic systems formulations. We prove that an NSFLS can uniformly approximate any given continuous function on a compact set and show that our NSFLS does a much better job of predicting a noisy chaotic time series than does a singleton fuzzy logic system (FLS)
Published in:
Fuzzy Systems, IEEE Transactions on
(Volume:5
,
Issue:
1
)
Date of Publication: Feb 1997
- Page(s):
- 56 - 71
- ISSN :
- 1063-6706
- INSPEC Accession Number:
- 5506295
- Digital Object Identifier :
- 10.1109/91.554447
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Feb 1997
- Sponsored by :
- IEEE Computational Intelligence Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
