By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hector Bernal ; department of Electronics Engineering at Universidad Distrital Francisco José de Caldas and the Laboratory for Automation, Microelectronics and Computational Intelligence, Bogotá D.C, Colombia ; Karina Duran ; Miguel Melgarejo

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 uniique 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.

Published in:

Fuzzy Systems, 2008. FUZZ-IEEE 2008. (IEEE World Congress on Computational Intelligence). IEEE International Conference on

Date of Conference:

1-6 June 2008