Abstract
AbstractThe 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.
Funder
National Natural Science Foundation of China
Doctoral Start-up Foundation of Liaoning Province
Youth Fund of Education Department of Liaoning Province
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Engineering (miscellaneous),Information Systems,Artificial Intelligence
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献