Abstract
Computing the centroid and performing type-reduction for type-2 fuzzy sets and systems are operations that must be taken into consideration. Karnik-Mendel (KM) algorithms are the standard ways to do these operations; however, because these algorithms are iterative, much research has been conducted during the past decade about centroid and type-reduction computations. This tutorial paper focuses on the research that has been conducted to 1) improve the KM algorithms; 2) understand the KM algorithms, leading to further improved algorithms; 3) eliminate the need for KM algorithms; 4) use the KM algorithms to solve other (nonfuzzy logic system) problems; and 5) use (or not use) KM algorithms for general type-2 fuzzy sets and fuzzy logic systems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
