An efficient centroid type-reduction strategy for general type-2 fuzzy logic system
Information Sciences: an International Journal
Information Sciences: an International Journal
Fuzzy subsethood for fuzzy sets of type-2 and generalized type-n
IEEE Transactions on Fuzzy Systems
Enhanced Karnik-Mendel algorithms
IEEE Transactions on Fuzzy Systems
α-plane representation for type-2 fuzzy sets: theory and applications
IEEE Transactions on Fuzzy Systems
Perceptual reasoning for perceptual computing: a similarity-based approach
IEEE Transactions on Fuzzy Systems
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 7
Computing with words for hierarchical decision making applied to evaluating a weapon system
IEEE Transactions on Fuzzy Systems - Special section on computing with words
IEEE Transactions on Fuzzy Systems
Comparative study of type-2 fuzzy sets and cloud model
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Study on enhanced Karnik-Mendel algorithms: Initialization explanations and computation improvements
Information Sciences: an International Journal
Analytical solution methods for the fuzzy weighted average
Information Sciences: an International Journal
Computers and Industrial Engineering
Multiattribute decision making based on interval-valued intuitionistic fuzzy values
Expert Systems with Applications: An International Journal
Simplified type-2 fuzzy sliding controller for wing rock system
Fuzzy Sets and Systems
Novel Weighted Averages versus Normalized Sums in Computing with Words
Information Sciences: an International Journal
Journal of Computer and System Sciences
A reconstruction decoder for computing with words
Information Sciences: an International Journal
Hi-index | 0.00 |
By connecting work from two different problems-the fuzzy weighted average (FWA) and the generalized centroid of an interval type-2 fuzzy set-a new alpha-cut algorithm for solving the FWA problem has been obtained, one that is monotonically and superexponentially convergent. This new algorithm uses the Karnik-Mendel (KM) algorithms to compute the FWA -cut end-points. It appears that the KM -cut algorithms approach for computing the FWA requires the fewest iterations to date, and may therefore be the fastest available FWA algorithm to date.