DocumentCode :
2973920
Title :
Enhanced centroid-flow algorithm for general type-2 fuzzy sets
Author :
Daoyuan Zhai ; Mendel, J.M.
Author_Institution :
Ming Hsieh Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA
fYear :
2011
fDate :
18-20 March 2011
Firstpage :
1
Lastpage :
6
Abstract :
The Centroid Flow (CF) algorithm is a newly proposed approach for computing the centroid of a type-2 fuzzy set Ã, which normally can be obtained by taking the union of the centroids of all the α-planes of Ã. The CF algorithm utilizes the Karnik-Mendel (KM) or the Enhanced KM (EKM) algorithm only once at the α = 0 α-plane, and then lets its result “flows” stepwise to the α = 1 α-plane. The CF algorithm avoids applying the KM/EKM algorithms at every α-plane, and, therefore, significantly improves the computational efficiency. However, certain approximation errors of the CF algorithm will gradually accumulate as the algorithm “flows” upwards, and, in some cases, this can slightly bias the overall outcome. This paper introduces an Enhanced CF (ECF) algorithm that can reduce such accumulative errors by half, and, therefore, allows us to compute the centroid of à with much higher accuracy.
Keywords :
fuzzy set theory; CF algorithm; enhanced Karnik-Mendel algorithm; enhanced centroid-flow algorithm; general type-2 fuzzy sets; Accuracy; Algorithm design and analysis; Approximation algorithms; Computational efficiency; Computational modeling; Equations; Frequency selective surfaces; Centroid Flow algorithm; Enhanced Centroid Flow algorithm; Enhanced Karnik-Mendel algorithms; Karnik-Mendel algorithms; centroid; general type-2 fuzzy sets;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Fuzzy Information Processing Society (NAFIPS), 2011 Annual Meeting of the North American
Conference_Location :
El Paso, TX
ISSN :
Pending
Print_ISBN :
978-1-61284-968-3
Electronic_ISBN :
Pending
Type :
conf
DOI :
10.1109/NAFIPS.2011.5751918
Filename :
5751918
Link To Document :
بازگشت