Abstract
The paper performs the center-of-sets (COS) type-reduction (TR) and de-fuzzification for Takagi–Sugeno–Kang (TSK) type general type-2 fuzzy logic systems (GT2 FLSs) on the basis of the alpha-planes expression of general type-2 fuzzy sets. Actually, comparing the popular Karnik–Mendel (KM) algorithms with other non-iterative algorithms is an important question in T2 society. Here the modules of fuzzy inference, COS TR, and de-fuzzification for TSK type GT2 FLSs are discussed by means of non-iterative Nagar–Bardini (NB) algorithms, Nie–Tan (NT) algorithms, and Begian–Melek–Mendel (BMM) algorithms. Simulation instances are constructed to illustrate the performances of three types of non-iterative algorithms compared with the KM algorithms. It is proved that, the proposed non-iterative algorithms can enhance the computational efficiencies significantly, which afford the potential application value for designers of GT2 FLSs.
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.
