Abstract
Based on a new continuous Karnik-Mendel (KM) algorithm expression, this paper proves that the centroid computation of an interval type-2 fuzzy set using KM algorithms is equivalent to the Newton-Raphson method in root-finding, which reveals the mechanisms in KM algorithm computation. The theoretical results of KM algorithms are re-obtained. Different from current KM algorithms, centroid computation methods that use different root-finding routines are provided. Such centroid computation methods can obtain the exact solution and are different from the current approximate methods using sampled data. Further improvements and analysis of the centroid problem using root-finding and integral computation techniques are also possible.
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.
