Abstract
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).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
