Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.