Asset Details
Do you wish to reserve the book?
Discrete Non-iterative Centroid Type-Reduction Algorithms on General Type-2 Fuzzy Logic Systems
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Discrete Non-iterative Centroid Type-Reduction Algorithms on General Type-2 Fuzzy Logic Systems
Do you wish to request the book?
Discrete Non-iterative Centroid Type-Reduction Algorithms on General Type-2 Fuzzy Logic Systems
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Discrete Non-iterative Centroid Type-Reduction Algorithms on General Type-2 Fuzzy Logic Systems
2021
Overview
Since the alpha-planes expressions of general type-2 fuzzy sets (GT2 FSs) have been proposed, general type-2 fuzzy logic systems (GT2 FLSs) that are dependent on GT2 FSs are becoming quite popular to fuzzy logic researchers. Usually enhanced Karnik–Mendel (EKM) algorithms are adopted for performing the kernel block of type-reduction (TR). However, the essence of EKM-based TR process probably hinders the GT2 FLSs from real-world applications. It is an intriguing as well as unsolved problem for comparing EKM algorithms with other non-iterative algorithms. This paper provides a framework encompassing fuzzy reasoning, defuzzification, as well as type-reduction. Furthermore, the continuous of NT (CNT) algorithm is shown to be a precise approach when it is used to execute the centroid TR of GT2 fuzzy logic systems. Four computer tests display the characteristics of discrete Nagar-Bardini (NB) and Nie-Tan (NT) non-iterative algorithms. Compared with EKM approach, the developed one exhibits some superiorities in terms of guaranteeing high computation accuracy and low computation burdens, which broadens the application ranges for the proposed method.
Publisher
Springer Berlin Heidelberg,Springer Nature B.V
