Skip to Main Content
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.