Abstract
Type-reduction (TR) is a key block for interval type-2 fuzzy logic systems (IT2 FLSs). In general, Karnik-Mendel (KM) (or enhanced Karnik-Mendel (EKM)) algorithms are used to perform the TR. These two types of algorithms have the advantage of preserving the uncertainties of membership functions (MFs) flow in IT2 FLSs. This paper gives the initialization explanations of KM and EKM algorithms, and proposes reasonable initialization enhanced Karnik-Mendel (RIEKM) algorithms for centroid TR of IT2 FLSs. By considering the accurate continuous Nie-Tan (CNT) algorithms as the benchmark, four computer simulation examples are adopted to illustrate and analyze the performances of RIEKM algorithms for solving the centroid TR and defuzzification of IT2 FLSs. Compared with the EKM algorithms, the proposed RIEKM algorithms have smaller absolute errors and faster convergence speeds, which afford the potential value for designing and applying IT2 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.
