A comparative study between two algorithms for computing the generalized centroid of an interval type-2 fuzzy set

Abstract

this paper presents a comparative study between two iterative algorithms for computing the generalized centroid of an interval type-2 fuzzy set. The first procedure is the so called Enhanced Karnik-Mendel (EKM) algorithm. The latter, introduced here as a Recursive Algorithm with Unique Loop (RAUL), is a modification of a previously reported procedure. The study compares the computing time of both algorithms for three prototype Footprints of Uncertainty and several discretizations of the universe of discourse. Results point out that RAUL is faster than the EKM algorithm when less than 100 discretization points are used to describe the footprint of uncertainty.