# Study on Centroid Type-Reduction of Interval Type-2 Fuzzy Logic Systems Based on Noniterative Algorithms

Authors: Yang Chen
Journal: Complexity
 (2019)

---

## Abstract

Interval type-2 fuzzy logic systems have favorable abilities to cope with uncertainties in many applications. While the block type-reduction under the guidance of inference plays the central role in the systems, Karnik-Mendel (KM) iterative algorithms are standard algorithms to perform the type-reduction; however, the high computational cost of type-reduction process may hinder them from real applications. The comparison between the KM algorithms and other alternative algorithms is still an open problem. This paper introduces the related theory of interval type-2 fuzzy sets and discusses the blocks of fuzzy reasoning, type-reduction, and defuzzification of interval type-2 fuzzy logic systems by combining the Nagar-Bardini (NB) and Nie-Tan (NT) noniterative algorithms for solving the centroids of output interval type-2 fuzzy sets. Moreover, the continuous version of NT (CNT) algorithms is proved to be accurate algorithms for performing the type-reduction. Four computer simulation examples are provided to illustrate and analyze the performances of two kinds of noniterative algorithms. The NB and NT algorithms are superior to the KM algorithms on both calculation accuracy and time, which afford the potential application value for designer and adopters of type-2 fuzzy logic systems.


---

## Body

## 1. Introduction

As we all know, the membership grades of type-1 fuzzy sets (T1 FSs) are crisp numbers. While the membership grades of type-2 fuzzy sets (T2 FSs) are themselves T1 FSs, type-2 fuzzy sets (T2 FSs) and type-2 fuzzy logic systems (T2 FLSs) are hot topics in current academic area. As the membership grades of interval type-2 fuzzy sets (IT2 FSs) are all uniformly equal to 1, they can be completely characterized by the corresponding footprint of uncertainty (FOU) composed of the upper membership function (UMF) and lower membership function (LMF). Currently, the computational relative simple IT2 FLSs have been successfully applied in many areas with high uncertainty, nonlinearity and time-varying behavior [1] like financial systems [2], computing with words [3], power systems [4–6], intelligent controllers [7–9], permanent magnetic drive [10, 11], pattern recognition [12, 13], medical systems [14], recommendation systems [15], and so on. Moreover, the performances of IT2 FLSs are superior to their T1 counterparts.In general, an IT2 FLS is composed of five blocks as fuzzifier, rules, inference, type-reducer, and defuzzifier (see Figure1). In fact, the principle of IT2 FLSs is similar to T1 FLSs, while the major difference between them is that there must be at least one IT2 FS in the rules of IT2 FLSs. A T1 FLSs does not contain the block of type-reduction. In addition, the type-reduction under the guidance of inference is a central block in IT2 FLSs, which mainly plays the role of transforming the output IT2 FS obtained from fuzzy reasoning [16] to the T1 FS. Next, the crisp output is acquired according to the block of defuzzification. The process of type-reduction is usually performed by the most popular computationally intensive KM iterative algorithms [17–19]; however, the complex computations make the applications of IT2 FLSs more challenge. When all the uncertainties of IT2 FSs disappear, the IT2 FLSs degenerate to the T1 FLSs.Figure 1
An IT2 FLS [41].In early times, Mendel et al. developed the KM algorithms to compute the centroids IT2 FSs or perform the centroid type-reduction (TR) of IT2 FLSs. In order to reduce the computational cost, Wu and Mendel proposed the enhanced version of KM (EKM [20]) algorithms. As the continuous versions of KM or EKM algorithms (CKM or CEKM [21, 22]) were proposed, which gave a huge push for the theoretical studies of IT2 FLSs. Mendel and Liu analyzed and proved the monotoncity and superexponential convergence [23] of CKM algorithms. In recent years, Nagar and Bardini verified that IT2 FLSs based on the NB algorithms [24] have superior performances to respond to the effect of uncertainties in the systems’ parameters to the IT2 FLSs based on other type-reduction (TR) algorithms like EKM, Wu-Mendel Uncertainty Bound (WM-UB [25]), Begian Melek Mendel (BMM [26, 27]), and Greenfield-Chiclana Collapsing Defuzzifier (GCCD[28]). Furthermore, Nie-Tan (NT) algorithms [29] were proved to be excellent approach to simplify IT2 FLSs. While the continuous versions of NT (CNT) algorithms [30] were verified to be accurate algorithms for solving the centroids of IT2 FSs, in a word, all these works laid enrich theoretical foundations for studying and applying the TR algorithms of IT2 FLSs.Inspired by [16, 19, 22–24, 29–37], this paper proposes the continuous of NB and NT (CNB and CNT) algorithms and brings connections between NB, NT, and BMM algorithms. The blocks of fuzzy reasoning, centroid type-reduction, and defuzzification of IT2 FLSs are performed by combining the NB and NT algorithms. Moreover, the CNT algorithms are proved to be accurate algorithms for performing the centroid TR of IT2 FLSs. Numerical simulation examples analyze and illustrate the performances of two kinds of non-iterative algorithms for computing the centroid defuzzified values compared with the KM algorithms. The simulation studies show that the two kinds of noniterative algorithms can effectively improve both the calculation accuracy and the efficiency for obtaining the outputs of IT2 FLSs.The rest of this paper is organized as follows. Section2 introduces the background knowledge of IT2 FSs and IT2 FLSs. Section 3 provides the NB and NT algorithms and how to use them to obtain the outputs of IT2 FLSs. Section 4 compares the performances of two kinds of noniterative algorithms with the KM algorithms according to the numerical examples. Finally the conclusions are given in Section 5.


## 2. Backgrounds

### 2.1. IT2 FSs

Definition 1.
A T2 FSA~ can be described by its T2 membership function (MF) μA~(x,u), i.e.,(1)A~=∫x∈X∫u∈JxμA~x,ux,uwhere x∈X, u∈Jx⊆[0,1], and X denotes the universe of the primary variable x of A~. Here ∬‍ represents all the admissible x and u. The point-value representation of A~ is as(2)A~=x,u,μA~x,u∣∀x∈X,∀u∈0,1.Definition 2.
The secondary MF ofA~ is also called a vertical slice of μA~(x,u), i.e., [38](3)μA~x=x′,u≡μA~x′=∫u∈Jx′fx′uuwhere 0≤fx′(u)≤1, and μA~(x′) denotes the secondary MF of A~. The secondary membership grades of IT2 FSs all equal 1, that is to say, for any x=x′, fx′(u)≡1.Definition 3.
The two-dimensionalμA~(x,u) is referred to as the footprint of uncertainty (FOU) of A~, i.e.,(4)FOUA~=⋃x∈XJx=x,u∣u∈Jx⊆0,1where Jx represents the primary membership of A~; here the lower MF (LMF) μ_A~(x) and upper MF (UMF) μ¯A~(x) comprise the FOU, where [39](5)μ_A~x=LMFA~=inf⁡u∣u∈0,1,μA~x,u>0(6)μ¯A~x=UMFA~=sup⁡u∣u∈0,1,μA~x,u>0.


### 2.2. IT2 FLSs

Generally speaking, there are two major architectures for IT2 FLSs, Mamdani type [5, 31] and Takagi-Sugeno-Kang (TSK) type [10, 40]. The paper pays attention to the Mamdani type. Without loss of generality, consider a Mamdani IT2 FLS with p inputs x1∈X1,…,xp∈Xp and one output y∈Y. The system can be completely characterized by M fuzzy rules, where the lth fuzzy rule is of the form:(7)R~l:  Ifx1isF~1land⋯andxpisF~pl,thenyisG~ll=1,…,M.The process of inference [5, 16, 31, 41] is as follows.In order to simplify the expressions, here we adopt the singleton fuzzifier [41]; i.e., the input measurements are modeled as type-0 FSs (singletons). The fuzzy implication relation between each fuzzy rule is as(8)R~l:F~1l×⋯×F~pl→G~l=A~l→G~lThe MF of (8) is as(9)μR~lx,y=μA~l→G~lx,y=μF~1lx1′∩⋯∩μF~plxp′∩μG~ly=⋂i=1pμF~ilxi′∩μG~lywhere ∩ represents the minimum or product t-norm operation [42].Then the output T2 FS of each fuzzy rule isB~l=A~x∘R~l, whose MF(10)μB~ly=μAx∘R~ly=⋃x∈XμAxx∩μA~l→G~lx,y=μG~ly∩⋂i=1pμF~ilxi′=μG~ly∩Flx′where ∘ denotes the composition operation and ∪ represents the maximum t-conorm operation [41]. Here Fl(x′) is defined as the firing interval of each fuzzy rule, when x=x′ and compute Fl:(11)Flx′≡f_lx′,f¯lx′f_lx′≡⋂i=1pμ_F~ilxi′f¯lx′≡⋂i=1pμ¯F~ilxi′While adopting the popular centroid TR [32], the firing output set B~l is generated from by each fuzzy rule and the corresponding consequent IT2 FS, i.e.,(12)B~l:FOUB~l=μ_B~ly∣x′,μ¯B~ly∣x′μ_B~ly∣x′=f_lx′∗μ_G~lyμ¯B~ly∣x′=f¯lx′∗μ¯G~lywhere ∗ also denotes the minimum or product t-norm operation.Next, the final outputB~ can be obtained by merging all the rule firing output sets B~l, i.e.,(13)B~:FOUB~=μ_B~y∣x′,μ¯B~y∣x′μ_B~y∣x′=μ_B~1y∣x′∨⋯∨μ_B~My∣x′μ¯B~y∣x′=μ¯B~1y∣x′∨⋯∨μ¯B~My∣x′where ∨ denotes the maximum operation. Then the type-reduced set YC(x′) can be obtained by computing the centroid CB~ of B~, i.e.,(14)YCx′=CB~x′=1lB~x′,rB~x′where the two points lB~(x′) and rB~(x′) can be calculated by popular type-reduction algorithms like KM [19, 41], EKM [20], and weighted EKM (WEKM [18, 22]).


## 2.1. IT2 FSs

Definition 1.
A T2 FSA~ can be described by its T2 membership function (MF) μA~(x,u), i.e.,(1)A~=∫x∈X∫u∈JxμA~x,ux,uwhere x∈X, u∈Jx⊆[0,1], and X denotes the universe of the primary variable x of A~. Here ∬‍ represents all the admissible x and u. The point-value representation of A~ is as(2)A~=x,u,μA~x,u∣∀x∈X,∀u∈0,1.Definition 2.
The secondary MF ofA~ is also called a vertical slice of μA~(x,u), i.e., [38](3)μA~x=x′,u≡μA~x′=∫u∈Jx′fx′uuwhere 0≤fx′(u)≤1, and μA~(x′) denotes the secondary MF of A~. The secondary membership grades of IT2 FSs all equal 1, that is to say, for any x=x′, fx′(u)≡1.Definition 3.
The two-dimensionalμA~(x,u) is referred to as the footprint of uncertainty (FOU) of A~, i.e.,(4)FOUA~=⋃x∈XJx=x,u∣u∈Jx⊆0,1where Jx represents the primary membership of A~; here the lower MF (LMF) μ_A~(x) and upper MF (UMF) μ¯A~(x) comprise the FOU, where [39](5)μ_A~x=LMFA~=inf⁡u∣u∈0,1,μA~x,u>0(6)μ¯A~x=UMFA~=sup⁡u∣u∈0,1,μA~x,u>0.


## 2.2. IT2 FLSs

Generally speaking, there are two major architectures for IT2 FLSs, Mamdani type [5, 31] and Takagi-Sugeno-Kang (TSK) type [10, 40]. The paper pays attention to the Mamdani type. Without loss of generality, consider a Mamdani IT2 FLS with p inputs x1∈X1,…,xp∈Xp and one output y∈Y. The system can be completely characterized by M fuzzy rules, where the lth fuzzy rule is of the form:(7)R~l:  Ifx1isF~1land⋯andxpisF~pl,thenyisG~ll=1,…,M.The process of inference [5, 16, 31, 41] is as follows.In order to simplify the expressions, here we adopt the singleton fuzzifier [41]; i.e., the input measurements are modeled as type-0 FSs (singletons). The fuzzy implication relation between each fuzzy rule is as(8)R~l:F~1l×⋯×F~pl→G~l=A~l→G~lThe MF of (8) is as(9)μR~lx,y=μA~l→G~lx,y=μF~1lx1′∩⋯∩μF~plxp′∩μG~ly=⋂i=1pμF~ilxi′∩μG~lywhere ∩ represents the minimum or product t-norm operation [42].Then the output T2 FS of each fuzzy rule isB~l=A~x∘R~l, whose MF(10)μB~ly=μAx∘R~ly=⋃x∈XμAxx∩μA~l→G~lx,y=μG~ly∩⋂i=1pμF~ilxi′=μG~ly∩Flx′where ∘ denotes the composition operation and ∪ represents the maximum t-conorm operation [41]. Here Fl(x′) is defined as the firing interval of each fuzzy rule, when x=x′ and compute Fl:(11)Flx′≡f_lx′,f¯lx′f_lx′≡⋂i=1pμ_F~ilxi′f¯lx′≡⋂i=1pμ¯F~ilxi′While adopting the popular centroid TR [32], the firing output set B~l is generated from by each fuzzy rule and the corresponding consequent IT2 FS, i.e.,(12)B~l:FOUB~l=μ_B~ly∣x′,μ¯B~ly∣x′μ_B~ly∣x′=f_lx′∗μ_G~lyμ¯B~ly∣x′=f¯lx′∗μ¯G~lywhere ∗ also denotes the minimum or product t-norm operation.Next, the final outputB~ can be obtained by merging all the rule firing output sets B~l, i.e.,(13)B~:FOUB~=μ_B~y∣x′,μ¯B~y∣x′μ_B~y∣x′=μ_B~1y∣x′∨⋯∨μ_B~My∣x′μ¯B~y∣x′=μ¯B~1y∣x′∨⋯∨μ¯B~My∣x′where ∨ denotes the maximum operation. Then the type-reduced set YC(x′) can be obtained by computing the centroid CB~ of B~, i.e.,(14)YCx′=CB~x′=1lB~x′,rB~x′where the two points lB~(x′) and rB~(x′) can be calculated by popular type-reduction algorithms like KM [19, 41], EKM [20], and weighted EKM (WEKM [18, 22]).


## 3. NB and NT Algorithms

In this section, we provide two kinds of noniterative for performing the centroid TR of IT2 FLSs; they are the NB and NT algorithms [24, 29, 30, 43].


### 3.1. NB Algorithms

The NB algorithms [24] offered a closed form of TR. After the process of fuzzy reasoning [16], let B~ be the obtained output IT2 FS and the primary variable y be equally discretized into N points that satisfies y1<y2<⋯<yN; then the two endpoints of centroid interval can be computed as(15)cl=∑i=1Nyiμ_B~yi∑i=1Nμ_B~yi,andcr=∑i=1Nyiμ¯B~yi∑i=1Nμ¯B~yi.The defuzzified output is computed as(16)yNB=cl+cr2.Similar to the CKM (or CEKM) algorithms [21–23, 34, 44], the continuous form of NB (CNB) algorithms can be adopted for studying the theoretical property of TR and defuzzification of IT2 FLSs.Suppose thata and b are the left and right endpoints of primary variable y, and y1<y2<⋯<yN; then the continuous form of (15) is as(17)cl=∫abyμ_B~ydy∫abμ_B~ydy,andcr=∫abyμ¯B~ydy∫abμ¯B~ydy.Unlike the traditional computational intensive KM algorithms [17–21], the NB algorithms may be suitable for real time applications. For the centroid interval, the two end points can be computed without iterations. Furthermore, the output is simply composed of the linear combination of two T1 FLSs: one constructed from the LMFs and the other constructed from the UMFs.


### 3.2. NT Algorithms

The NT algorithms also provide a closed form of TR. Supposing that the primary variabley is equally discretized into N points which satisfies y1<y2<⋯<yN, then the output centroid interval can be calculated as(18)yNT=∑i=1Nyiμ_B~yi+μ¯B~yi∑i=1Nμ_B~yi+μ¯B~yi.Then the continuous form of (18) can be as(19)yCNT=∫abyμ_B~y+μ¯B~ydy∫abμ_B~y+μ¯B~ydy.The most recent studies on calculating the centroid of IT2 FSs illustrate that the CNT algorithm [30] is an accurate approach. Next we prove that the CNT algorithm is accurate method for performing the centroid TR and defuzzification of IT2 FLSs according to simple statements and explanations as follows.As we all know, the random sampling is an approximate method for performing the TR and defuzzification of IT2 FLSs. As the number of sampling points approaches infinity, it is reasonable to believe that the random sampling becomes an accurate TR and defuzzification.Theorem 4.
As the number of sampling approaches infinity, a random sampling algorithm can perform the accurate centroid TR and defuzzification of IT2 FLSs.Proof.
For the discrete output IT2 FSB~ defined in the universe of discourse of Y, let m be the number of horizontal slices along the μ-axis and n be the number of vertical slices along the y-axis. Because each T1 FS contains n vertical slices, the total number of embedded T1 FSs in B~ is mn.
Suppose thatμ¯(y) and μ_(y) is the UMF and LMF of FOU, respectively. In addition, we select k embedded T1 FSs from B~ randomly, and let μi(y) be the MF of the ith embedded set.
Then we aggregatek embedded T1 FS, i.e.,(20)∑i=1kμiy=∑j=1n∑i=1kμiyjtherefore(21)limk→∞1k∑i=1kμiy=limk→∞⁡1k∑i=1k∑j=1nμiyj.
Hereμi(yj) is a random value uniformly distributed in the interval [μ_i(yj),μ¯i(yj)], so the right side of (21) can be turned to(22)limk→∞1k∑i=1k∑j=1nμiyj=1m∑k=1m∑j=1nμkyj
For (22), as the right side of which is a random sampling with k→∞, the right side becomes exactly the aggregation of MFs of all embedded FSs of B~. Because m/k is just a constant, it has no effect for calculating the centroid of B~ (see (19)).
WhenB~ is a continuous IT2 FS, we simply substitute ∑j=1n‍ and ∑k=1m‍ by ∫yminymax‍ and ∫μ_(y)μ¯(y)‍, respectively. Then we get(23)limk→∞⁡mk∑i=1kμiy=∫yminymax∫μ_yμ¯yμydμdy.Theorem 5.
A representative T1 embedded FS ofB~ has the MF(24)μ∗y=12μ_y+μ¯yand the centroid of B~ can be computed as(25)CB~=∫yminymaxyμ∗ydy∫yminymaxμ∗ydyProof.
For the discrete output IT2 FSB~, we choose k embedded T1 FSs from B~ randomly. Suppose that μi(y) is the MF of ith embedded FS and yj is an arbitrary vertical slice. In addition, μi(yj) can be denoted as μi(yj)=μ_(yj)+ωi[μ¯(yj)-μ_(yj)], among which let ωi be a random number uniformly distributed within [0,1]. Thus, we get(26)∑i=1kμiyj=∑i=1kμ_yj+ωiμ¯yj-μ_yj=kμ_yj+μ¯yj-μ_yj∑i=1kωiAs ωi is uniformly distributed with [0,1], hence(27)limk→∞⁡∑i=1kωi=k2.Then we have(28)limk→∞⁡1k∑i=1kμiyj=12μ_yj+μ¯yjDue to the fact that yj is an arbitrary vertical slice, (28) holds for all y. Thus, we get(29)limk→∞⁡1k∑i=1kμiy=12μ_y+μ¯yBy mean of the above analysis (see (29) and Theorem 4), we know that μ∗(y)=1/2[μ_(y)+μ¯(y)] is the MF of a representative T1 FS and it can perform the accurate centroid TR and defuzzification of IT2 FLSs.
Here we adapt Theorems4 and 5 from [30]. It is simply to substitute the sum operation ∑i=1n‍by the integral operation ∫yminymax‍ to confirm the proofs to a continuous IT2 FS. The CNT algorithm performs the accurate centroid TR and defuzzification as it is equivalent to an exhaustive TR.
In fact, both the NB and the NT algorithms are special cases of BMM algorithms. And the BMM algorithms have been extensively studied for their stability and robustness [26, 27]. Next, we give an explanation as follows.
The closed form BMM TR algorithms calculate the output centroid interval as(30)yBMM=m∑i=1Nyiμ_B~yi∑i=1Nμ_B~yi+n∑i=1Nyiμ¯B~yi∑i=1Nμ¯B~yiHere m and n are adjustable coefficients.
Comparing (30), (15), and (16), we find that the NB and BMM algorithms are the same while m=mNB=1/2 and n=nNB=1/2. Next, let us consider the NT algorithms. Equation (18) can be transformed to(31)yNT=∑i=1Nμ_B~yi∑i=1Nμ_B~yi+μ¯B~yi×∑i=1Nyiμ_B~yi∑i=1Nμ_B~yi+∑i=1Nμ¯B~yi∑i=1Nμ_B~yi+μ¯B~yi×∑i=1Nyiμ¯B~yi∑i=1Nμ¯B~yi=mNT∑i=1Nyiμ_B~yi∑i=1Nμ_B~yi+nNT∑i=1Nyiμ¯B~yi∑i=1Nμ¯B~yiwhere(32)mNT=∑i=1Nμ_B~yi∑i=1Nμ_B~yi+μ¯B~yi(33)nNT=∑i=1Nμ¯B~yi∑i=1Nμ_B~yi+μ¯B~yi.
Comparing (31) and (16), we find that the NT and BMM algorithms are the same when m=mNT and n=nNT. The above analysis provides connections between BMM algorithm and NB and NT algorithms. And both NB and NT algorithms are special cases of BMM algorithms.


## 3.1. NB Algorithms

The NB algorithms [24] offered a closed form of TR. After the process of fuzzy reasoning [16], let B~ be the obtained output IT2 FS and the primary variable y be equally discretized into N points that satisfies y1<y2<⋯<yN; then the two endpoints of centroid interval can be computed as(15)cl=∑i=1Nyiμ_B~yi∑i=1Nμ_B~yi,andcr=∑i=1Nyiμ¯B~yi∑i=1Nμ¯B~yi.The defuzzified output is computed as(16)yNB=cl+cr2.Similar to the CKM (or CEKM) algorithms [21–23, 34, 44], the continuous form of NB (CNB) algorithms can be adopted for studying the theoretical property of TR and defuzzification of IT2 FLSs.Suppose thata and b are the left and right endpoints of primary variable y, and y1<y2<⋯<yN; then the continuous form of (15) is as(17)cl=∫abyμ_B~ydy∫abμ_B~ydy,andcr=∫abyμ¯B~ydy∫abμ¯B~ydy.Unlike the traditional computational intensive KM algorithms [17–21], the NB algorithms may be suitable for real time applications. For the centroid interval, the two end points can be computed without iterations. Furthermore, the output is simply composed of the linear combination of two T1 FLSs: one constructed from the LMFs and the other constructed from the UMFs.


## 3.2. NT Algorithms

The NT algorithms also provide a closed form of TR. Supposing that the primary variabley is equally discretized into N points which satisfies y1<y2<⋯<yN, then the output centroid interval can be calculated as(18)yNT=∑i=1Nyiμ_B~yi+μ¯B~yi∑i=1Nμ_B~yi+μ¯B~yi.Then the continuous form of (18) can be as(19)yCNT=∫abyμ_B~y+μ¯B~ydy∫abμ_B~y+μ¯B~ydy.The most recent studies on calculating the centroid of IT2 FSs illustrate that the CNT algorithm [30] is an accurate approach. Next we prove that the CNT algorithm is accurate method for performing the centroid TR and defuzzification of IT2 FLSs according to simple statements and explanations as follows.As we all know, the random sampling is an approximate method for performing the TR and defuzzification of IT2 FLSs. As the number of sampling points approaches infinity, it is reasonable to believe that the random sampling becomes an accurate TR and defuzzification.Theorem 4.
As the number of sampling approaches infinity, a random sampling algorithm can perform the accurate centroid TR and defuzzification of IT2 FLSs.Proof.
For the discrete output IT2 FSB~ defined in the universe of discourse of Y, let m be the number of horizontal slices along the μ-axis and n be the number of vertical slices along the y-axis. Because each T1 FS contains n vertical slices, the total number of embedded T1 FSs in B~ is mn.
Suppose thatμ¯(y) and μ_(y) is the UMF and LMF of FOU, respectively. In addition, we select k embedded T1 FSs from B~ randomly, and let μi(y) be the MF of the ith embedded set.
Then we aggregatek embedded T1 FS, i.e.,(20)∑i=1kμiy=∑j=1n∑i=1kμiyjtherefore(21)limk→∞1k∑i=1kμiy=limk→∞⁡1k∑i=1k∑j=1nμiyj.
Hereμi(yj) is a random value uniformly distributed in the interval [μ_i(yj),μ¯i(yj)], so the right side of (21) can be turned to(22)limk→∞1k∑i=1k∑j=1nμiyj=1m∑k=1m∑j=1nμkyj
For (22), as the right side of which is a random sampling with k→∞, the right side becomes exactly the aggregation of MFs of all embedded FSs of B~. Because m/k is just a constant, it has no effect for calculating the centroid of B~ (see (19)).
WhenB~ is a continuous IT2 FS, we simply substitute ∑j=1n‍ and ∑k=1m‍ by ∫yminymax‍ and ∫μ_(y)μ¯(y)‍, respectively. Then we get(23)limk→∞⁡mk∑i=1kμiy=∫yminymax∫μ_yμ¯yμydμdy.Theorem 5.
A representative T1 embedded FS ofB~ has the MF(24)μ∗y=12μ_y+μ¯yand the centroid of B~ can be computed as(25)CB~=∫yminymaxyμ∗ydy∫yminymaxμ∗ydyProof.
For the discrete output IT2 FSB~, we choose k embedded T1 FSs from B~ randomly. Suppose that μi(y) is the MF of ith embedded FS and yj is an arbitrary vertical slice. In addition, μi(yj) can be denoted as μi(yj)=μ_(yj)+ωi[μ¯(yj)-μ_(yj)], among which let ωi be a random number uniformly distributed within [0,1]. Thus, we get(26)∑i=1kμiyj=∑i=1kμ_yj+ωiμ¯yj-μ_yj=kμ_yj+μ¯yj-μ_yj∑i=1kωiAs ωi is uniformly distributed with [0,1], hence(27)limk→∞⁡∑i=1kωi=k2.Then we have(28)limk→∞⁡1k∑i=1kμiyj=12μ_yj+μ¯yjDue to the fact that yj is an arbitrary vertical slice, (28) holds for all y. Thus, we get(29)limk→∞⁡1k∑i=1kμiy=12μ_y+μ¯yBy mean of the above analysis (see (29) and Theorem 4), we know that μ∗(y)=1/2[μ_(y)+μ¯(y)] is the MF of a representative T1 FS and it can perform the accurate centroid TR and defuzzification of IT2 FLSs.
Here we adapt Theorems4 and 5 from [30]. It is simply to substitute the sum operation ∑i=1n‍by the integral operation ∫yminymax‍ to confirm the proofs to a continuous IT2 FS. The CNT algorithm performs the accurate centroid TR and defuzzification as it is equivalent to an exhaustive TR.
In fact, both the NB and the NT algorithms are special cases of BMM algorithms. And the BMM algorithms have been extensively studied for their stability and robustness [26, 27]. Next, we give an explanation as follows.
The closed form BMM TR algorithms calculate the output centroid interval as(30)yBMM=m∑i=1Nyiμ_B~yi∑i=1Nμ_B~yi+n∑i=1Nyiμ¯B~yi∑i=1Nμ¯B~yiHere m and n are adjustable coefficients.
Comparing (30), (15), and (16), we find that the NB and BMM algorithms are the same while m=mNB=1/2 and n=nNB=1/2. Next, let us consider the NT algorithms. Equation (18) can be transformed to(31)yNT=∑i=1Nμ_B~yi∑i=1Nμ_B~yi+μ¯B~yi×∑i=1Nyiμ_B~yi∑i=1Nμ_B~yi+∑i=1Nμ¯B~yi∑i=1Nμ_B~yi+μ¯B~yi×∑i=1Nyiμ¯B~yi∑i=1Nμ¯B~yi=mNT∑i=1Nyiμ_B~yi∑i=1Nμ_B~yi+nNT∑i=1Nyiμ¯B~yi∑i=1Nμ¯B~yiwhere(32)mNT=∑i=1Nμ_B~yi∑i=1Nμ_B~yi+μ¯B~yi(33)nNT=∑i=1Nμ¯B~yi∑i=1Nμ_B~yi+μ¯B~yi.
Comparing (31) and (16), we find that the NT and BMM algorithms are the same when m=mNT and n=nNT. The above analysis provides connections between BMM algorithm and NB and NT algorithms. And both NB and NT algorithms are special cases of BMM algorithms.


## 4. Simulation

In this section, four computer simulation examples are provided to illustrate the performances of two kinds of noniterative algorithms compared with the KM algorithms. Before performing the TR, we suppose that the FOU of output IT2 FS is known according to merging or weighting all the fuzzy rules under the guidance of inference [16]. For the first example, the FOU is bounded by the piecewise linear functions [22, 29, 30, 36]. For the second example, the FOU is composed of piecewise linear functions and Gaussian functions [22, 23, 27, 30]. For the third example, the FOU is bounded by the Gaussian functions [22, 29, 30, 36]. For the last example, the whole FOU is the symmetric Gaussian MF with uncertainty derivation [22, 23, 27, 30].Here we perform the centroid TR for the IT2 FLSs. Suppose that the primary variable of the output IT2 FS is the letterx. Furthermore, select the number of sampling points of primary variable as N=50:50:4000. Figure 2 gives the FOU graphs for four examples. In addition, Table 1 provides the FOU MF expressions for four examples. Considering both Figure 2 and Table 1, we can clearly find that the nonlinearity of these FOUs gets greater from Example one to Example four. Then let us compare the performances of NB, NT, and KM algorithms on the benchmark of CNT algorithms.Table 1
FOU MF expressions of four examples.
Num FOU MF expressions 1 μ _ A ~ 1 ( x ) = m a x x - 1 6 , 1 ≤ x ≤ 4 7 - x 6 , 4 < x ≤ 7 0 , o t h e r w i s e , x - 3 6 , 3 ≤ x ≤ 5 8 - x 9 , 5 < x ≤ 8 0 , o t h e r w i s e μ ¯ A ~ 1 ( x ) = m a x x - 1 2 , 1 ≤ x ≤ 3 7 - x 4 , 3 < x ≤ 7 0 , o t h e r w i s e , x - 2 5 , 2 ≤ x ≤ 6 16 - 2 x 5 , 6 < x ≤ 8 0 , o t h e r w i s e  2 μ _ A ~ 2 ( x ) = 0.6 ( x + 5 ) 19 , - 5 ≤ x ≤ 2.6 0.4 ( 14 - x ) 19 , 2.6 < x ≤ 14 μ ¯ A ~ 2 ( x ) = exp ⁡ - 1 2 x - 2 5 2 , - 5 ≤ x ≤ 7.185 exp ⁡ - 1 2 x - 9 1.75 2 , 7.185 < x ≤ 14  3 μ _ A ~ 3 ( x ) = m a x 0.5 exp ⁡ - x - 3 2 2 ,   0.4 exp ⁡ - ( x - 6 ) 2 2 ​ ​ μ ¯ A ~ 3 ( x ) = m a x exp ⁡ - 0.5 ( x - 3 ) 2 4 ,   0.8 exp ⁡ - 0.5 x - 6 2 4 ​ ​ x ∈ [ 0,10 ].  4 μ _ A ~ 4 ( x ) = exp ⁡ - 1 2 x - 3 0.25 2 ​ ​ μ ¯ A ~ 4 ( x ) = exp ⁡ - 1 2 x - 3 1.75 2 x ∈ [ 0,10 ].Figure 2
FOU graphs of four examples; (a) example 1, (b) example 2, (c) example 3, and (d) example 4.
(a) (b) (c) (d)In the first example, the CNT algorithms are first adopted to calculate the benchmark defuzzified valuey1∗=4.320794. Then the graph of defuzzified values for the NB, NT, and KM algorithms is shown in Figure 3(a); moreover, the functional graph of absolute errors between CNT and NB, NT, and KM algorithms is provided in Figure 3(b).Figure 3
Calculation results of example one.
(a) (b)For the second example, we adopt the CNT algorithms to calculate the benchmark defuzzified valuey2∗=3.714087. Then we provide the graph of defuzzified values for the NB, NT, and KM algorithms in Figure 3(a) and the functional graph of absolute errors between CNT and NB, NT, and KM algorithms in Figure 3(b).In the third example, the CNT algorithms are first adopted to calculate the benchmark defuzzified valuey3∗=4.395260. Then the graph of defuzzified values for the NB, NT, and KM algorithms is shown in Figure 5(a); moreover, the functional graph of absolute errors between CNT and NB, NT, and KM algorithms is provided in Figure 5(b).For the fourth example, we adopt the CNT algorithms to calculate the benchmark defuzzified valuey4∗=4.999999. Then we provide the graph of defuzzified values for the NB, NT, and KM algorithms in Figure 6(a) and the functional graph of absolute errors between the CNT and NB, NT, and KM algorithms in Figure 6(b).Then we measure the performances of NB, NT, and KM algorithms for the above examples. As the number of sampling points is chosen asN=50:50:4000, we define the relative error as |yi-yi∗|/|yi∗|(i=1,2,3). Table 2 gives the mean relative errors of NB, NT, and KM algorithms, where the last column is the total average mean relative errors of them.Table 2
Mean relative errorsyi-yi∗/yi∗(i=1,2,3) for the number of sampling points N=50:50:4000.
Algorithms NB NT KM Example one 0.00366072 0.00000043 0.00122808 Example two 0.01664610 0.00067605 0.02211606 Example three 0.00579088 0.00013729 0.00443448 Example four 0.00000028 0.00000028 0.00000028 Total average 0.00652449 0.00020351 0.00694472From Figures3–6 and Table 2, the following conclusions can be obtained:Figure 4
Calculation results of example two.
(a) (b)Figure 5
Calculation results of example three.
(a) (b)Figure 6
Calculation results of example four.
(a) (b)( 1 ) The absolute errors of NB, NT, and KM algorithms all converge to some extent as the number of sampling points increases. For both examples one and three, the NT algorithms can obtain the smallest absolute error, whereas the NB algorithms obtain the largest absolute error. For example three, the NT algorithms also obtain the smallest absolute error, whereas the KM algorithms obtain the largest absolute error. For example four, these three types of algorithms almost obtain the same absolute error (see Figure 6(b), the unit of vertical axis is 10-6). Moreover, the amplitude of variation of absolute errors for them three is really not big.( 2 ) See Table 2; the largest mean relative error of NT algorithms is 0.013729%, while the largest mean relative errors for the NB and KM algorithms are 1.664610% and 2.211606%, respectively. Furthermore, the total average mean relative error of NT algorithms is 0.020351%, while the total average mean relative errors for the NB and NT algorithms are 0.652444% and 0.694472%, respectively.( 3 ) Considering the above items (1) and (2) comprehensively, we believe that the NT algorithms can obtain the best accuracy, while the NB algorithms take second place.Next we investigate the computation time for the above algorithms. The unit of time is chosen as the second (s). As for calculating the defuzzified values, the computation time results rely on the specific hardware and software environments. In addition, it is unrepeatable for the results. In the paper, the simulations are performed by a dual-core CPU dell desktop with E5300@2.60GHz and 2.00 GB memory, Windows XP operation system, and the programming software of Matlab 2013a. Then we give the computation time comparisons for the four examples in the Figures7–10.Figure 7
Computation time comparisons of example one.Figure 8
Computation time comparisons of example two.Figure 9
Computation time comparisons of example three.Figure 10
Computation time comparisons of example four.Supposing that the influence of fluctuation of number of sampling pointsN with respect to the computation time is not considered, then the above three types of algorithms vary linearly in terms of N. Here we select the least square regression model t=α+βN for them, in which t is the computation time and Table 3 provides the regression coefficients. Moreover, the computation time difference rate is defined as(34)maxi=1,…,4⁡ti-mini=1,…,4⁡timaxi=1,…,4⁡tiwhere ti(i=1,2,3,4) is the computation time for NB, NT and KM algorithms.Table 3
Computations of the regression model coefficients by the least square for the NB, NT, and KM algorithms.
Coefficients NB NT KM α / 1 0 - 3 α / 1 0 - 3 α / 1 0 - 3 β / 1 0 - 3 β / 1 0 - 3 β / 1 0 - 3 Example one 0.0001 0.0002 0.0050 0.1572 0.0827 0.0502 Example two 0.0001 0.0001 0.0062 0.1392 0.0915 -0.2596 Example three 0.0001 0.0001 0.0051 0.1217 0.0872 -0.0017 Example four 0.0001 0.0001 0.0069 0.0564 0.0803 0.1580 Average 0.0001 0.0001 0.0058 0.1186 0.0854 -0.0133From Figures7–10 and Table 3, we can draw the conclusion that the computation time of NB and NT algorithms are much better than the KM algorithms. In the above four examples, the average computation time of both NB and NT algorithms is at least twenty times better than the KM algorithms. Here the computation time of NB and NT algorithms is very similar, while the latter is only slightly better than the former. Furthermore, the computation time difference rate for three types of algorithms is between 61.65%~99.20%.The noniterative algorithms can be adopted for studying the centroid TR of IT2 FLSs. If only the computation accuracy were considered, according to Table2, the best choice should have been the NT algorithms. Observing both Figures 7–10 and Table 2, we suggest one shares the NT algorithms to perform the centroid TR of IT2 FLSs with the piecewise linear functions as in example one, the hybrid functions as in example two, and the Gaussian functions as in example three and adopt the NB or NT algorithms to compute the centroid TR of IT2 FLSs with the Gaussian T2 MF with uncertain derivation as in example four.At present, because there is no comprehensive comparison on the performance of KM TR algorithms and other alternative TR algorithms (which is still an interesting open problem), the paper pays attention to the theoretical studies of NB, NT, and KM algorithms according to the comparisons. On the basis of four numerical examples, as a certain number of sampling points is considered, both NB and NT algorithms improve the computation accuracy compared with the KM algorithms. After choosing the accurate CNT TR algorithms as the benchmark, the NT algorithms can obtain the best computation accuracy.


## 5. Conclusions

This paper proposes the CNB algorithms, proves the CNT algorithms to be accurate approach for performing the centroid TR of IT2 FLSs, and provides connections between the BMM algorithms and the NB, and NT algorithms. Then we choose the CNT algorithms as the benchmark to compute the defuzzified output of IT2 FLSs. According to the computation accuracy and time, four computer simulation examples illustrate the performances of NT, NT, and KM algorithms. Compared with the NB and KM algorithms, the NT algorithms can obtain smaller absolute errors and less computation time.There are still many interesting works that lie ahead, including studying the center of sets TR of IT2 and general T2 FLSs [30, 31, 34–37, 45] and investigating forecasting and control problems based on IT2 and GT2 FLSs optimized with swarm intelligence algorithms [46–51]. Future studies will give attention to the T2 FLSs design and applications.



---

*Source: 7325053-2019-04-11.xml*