Premium
Advantages of the Enhanced Opposite Direction Searching Algorithm for Computing the Centroid of An Interval Type‐2 Fuzzy Set
Author(s) -
Hu Huaizhong,
Wang Yong,
Cai Yuanli
Publication year - 2012
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.477
Subject(s) - centroid , fuzzy logic , set (abstract data type) , interval (graph theory) , algorithm , fuzzy set , type (biology) , reduction (mathematics) , computer science , mathematics , data mining , pattern recognition (psychology) , artificial intelligence , geometry , combinatorics , ecology , biology , programming language
Computing the centroid of an interval type‐2 fuzzy set ( IT2 FS ) is an important operation in a type‐2 fuzzy logic system (where it is called type‐reduction), but it is also a potentially time‐consuming operation. In this paper, an enhanced opposite direction searching ( EODS ) algorithm is presented for doing this. The EODS comes from an early version of the IT2 FS type‐reduction method called the opposite direction searching ( ODS ) algorithm, which has been proven faster than the most commonly used E nhanced K arnik‐ M endel ( EKM ) method. The EODS differs from the ODS in two high speed formulas for calculating the centroid endings. Quantitative analysis on the mathematical operations and comparisons performed by EODS , ODS , and EKM algorithms shows that EODS could save about 50% of the calculations and comparisons in relation to ODS . Compared with EKM , it could save about 67% to 80% of the calculations and comparisons. Simulation experiments have been performed to compare EODS with the ODS and EKM methods in terms of average CPU time. The experimental results validate the quantitative analysis.