Asset Details
Do you wish to reserve the book?
Study on centroid type-reduction of general type-2 fuzzy logic systems with weighted Nie–Tan algorithms
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?
Study on centroid type-reduction of general type-2 fuzzy logic systems with weighted Nie–Tan algorithms
Do you wish to request the book?
Study on centroid type-reduction of general type-2 fuzzy logic systems with weighted Nie–Tan algorithms
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
Study on centroid type-reduction of general type-2 fuzzy logic systems with weighted Nie–Tan algorithms
2018
Overview
In recent years, researching on general type-2 fuzzy logic systems (GT2 FLSs) has become a hot topic as the development of alpha-planes representation of general type-2 fuzzy sets. The iterative Karnik–Mendel (KM) algorithms are used to perform the key block of type-reduction (TR) of GT2 FLSs. However, the KM algorithms are computationally intensive and time-consuming, which is not adapted to real-time applications. In the enhanced types of algorithms, the noniterative Nie–Tan (NT) algorithms decrease the computational cost greatly. Moreover, the closed-form Nie–Tan algorithms which calculate the outputs by averaging the lower and upper bounds of the membership functions have been proved to be actually an accurate algorithm for performing TR. The paper expands the NT algorithms to three different forms of weighted NT (WNT) algorithms according to the Newton–Cotes quadrature formulas of numerical integration techniques. Four computer simulation examples are adopted to analyze the performances of WNT algorithms when solving the type-reduction of general type-2 fuzzy logic systems. The proposed WNT algorithms have smaller absolute errors and faster convergence speed compared with NT algorithms, which provide the potential value for designers and adopters of GT2 FLSs.
Publisher
Springer Berlin Heidelberg,Springer Nature B.V
