Abstract
In this paper we present a parametric formulation of interval approximation of fuzzy numbers. It is based on a more complex version of generalized Trutschnig et al. distance. General conclusions are showed and particular cases are studied in details.
Access provided by Autonomous University of Puebla. Download chapter PDF
Similar content being viewed by others
Keywords
- Fuzzy sets
- Fuzzy quantities
- Interval type-2 fuzzy sets
- Evaluation fuzzy numbers
- Interval approximation
- Weighting functions
1 Introduction
The problem to approximate a fuzzy set has been studied by several authors. Some of them use an interval approximation [1, 4–11], others use triangular or trapezoidal approximation. This idea is born with the aim of simplifying complicated calculations that appear in modeling and processing fuzzy optimization and control problems. In all these cases, even if we start with data described by fuzzy numbers of the easier forms like triangular and trapezoidal, the fuzzy outputs we meet are complicated and may have lost all the peculiarity of the starting sets. It is sufficient to look to a usual fuzzy control system output that may be neither normal nor convex.
In this paper we propose to substitute a given fuzzy number with an interval which has some properties like to be the nearest in some sense we describe. The results we present start from a paper of Grzegorzewski [10] in which he proposes the nearest interval to the original fuzzy number with respect to several distances. In particular we have focused on the distance introduced by Trutschnig et al. [13]. This distance depends on two parameters, a constant \(\theta \) and a function \(f(\alpha )\) that depends on the variable that individualizes the \(\alpha \)-cuts of a fuzzy set. We propose to consider even \(\theta \) as a function of \(\alpha \). This simple variation generates interesting results and connection with other important intervals connected with the initial fuzzy number defined in previous researches.
In Sect. 2 we give basic definitions and notations. In Sect. 3 we present an interval approximation for a fuzzy number obtained by minimizing a suitable functional. In Sects. 4 and 5 we study some properties of the approximation interval we have proposed. Finally, in Sect. 6 we apply our method to the interval approximation of trapezoidal fuzzy numbers.
2 Preliminaries and Notation
Let \(X\) denote a universe of discourse. A fuzzy set \(A\) in \(X\) is defined by a membership function \(\mu _A:X\rightarrow [0,1]\) which assigns to each element of \(X\), a grade of membership to the set \(A\). The height of \(A\) is \(h_A=\textit{height}\,A=\sup _{x\in X}\mu _A(x)\). The support and the core of \(A\) are defined, respectively, as the crisp sets \(\textit{supp}(A)=\{x\in X; \mu _A(x)>0\}\) and \(\textit{core}(A)=\{x\in X; \mu _A(x)=1\}\). A fuzzy set \(A\) is normal if its core is nonempty. A fuzzy number \(A\) is a fuzzy set of the real line \(\mathbb {R}\) with a normal, fuzzy convex and upper-semicontinuous membership function of bounded support (see, e.g., [2]). In accordance with the definition given above there exist four numbers \(a_1,a_2,a_3,a_4\in \mathbb {R}\), with \(a_1\le a_2\le a_3\le a_4\), and two functions \(l_A,r_A:\mathbb {R}\rightarrow [0,1]\) called the left side and the right side of \(A\), respectively, where \(l_A\) is nondecreasing and right-continuous and \(r_A\) is nonincreasing and left-continuous, such that
The \(\alpha \)-cut of a fuzzy set \(A\), \(0\le \alpha \le 1\), is defined as the crisp set \(A_{\alpha }=\left\{ x\in X; \mu _A(x)\ge \alpha \right\} \) if \(0<\alpha \le 1\) and as the closure of the support if \(\alpha =0\). Every \(\alpha \)-cut of a fuzzy number is a closed interval \(A_{\alpha }=[a_L(\alpha ),a_R(\alpha )]\), for \(0\le \alpha \le 1\), where \(a_L(\alpha )=\inf A_{\alpha }\) and \(a_R(\alpha )=\sup A_{\alpha }\).
In the following we will employ the mid-spread representation of intervals. The middle point and the spread of the interval \(I=[a,b]\) will be denoted, respectively, by \(\textit{mid}(I)=(a+b)/2\) and \(\textit{spr}(I)=(b-a)/2\).
3 Interval Approximation of Fuzzy Numbers
Our proposal starts from the Grzegorzewski papers in which the author defines and finds an interval approximation of a fuzzy number. Starting from a distance between two fuzzy numbers and observing that any closed interval is a fuzzy number, the author defines the approximating interval of a fuzzy number as the interval of minimum distance. The distance he uses is based on the distance between two closed intervals \(I\) and \(J\) introduced by Trutschnig et al. [13] defined by
where the mid-spread representation of the involved intervals is employed. The parameter \(\bar{\theta }\,\in \, ]0,1]\) indicates the relative importance of the spreads against the mids [10, 13]. The distance \(d_{\bar{\theta }}\) is extended to the space of all fuzzy number \(\mathbb {F}(\mathbb {R})\) by defining \(D_{\bar{\theta }}:\mathbb {F}(\mathbb {R})\times \mathbb {F}(\mathbb {R})\rightarrow [0,+\infty [\) such that for two arbitrary fuzzy numbers A and B
where the weighting function \(f:]0,1]\rightarrow [0,+\infty [\) is such that \(\int _{0}^{1}f(\alpha )\,d\alpha >0\).
In this paper we extend Grzegorzewski’s idea by considering the parameter \(\theta \) as a function of \(\alpha \) having in mind that the relative importance of the spreads against the mids may depend on the level of uncertainty. This hypothesis leads to interesting results.
Definition 1
We say that \(C^{*}(A)=[c^{*}_L,c^{*}_R]\) is an approximation interval of the fuzzy number \(A\) with respect to the pair \((f,\theta )\) if it minimizes the weighted mean of the squared distances
among all the intervals \(C=[c_L,c_R]\), where the weight function \(f:[0,1]\rightarrow [0,+\infty [\) is such that \(\int _{0}^{1}f(\alpha )\,d\alpha >0\) and \(\theta :[0,1]\rightarrow \,]0,1]\) is a function that indicates the relative importance of the spreads against the mids [10, 13].
Theorem 1
The approximation interval \(C^{*}(A)=C^{*}(A;f,\theta )=[c^{*}_L,c^{*}_R]\) of the fuzzy number \(A\) with respect to \((f,\theta )\) is given by
Proof
We have to minimize the function
with respect to \(c_L\) and \(c_R\). We obtain
By solving
we obtain that the solution \(C^*=C^*(A)=[c_L^{*},c_R^{*}]\) satisfies
and thus, since \(c_L^{*}=mid(C^*)-spr(C^*)\) and \(c_R^{*}=mid(C^*)+spr(C^*)\), we obtain (1). Moreover, by calculation, we get
and
and thus
and \(\frac{\partial ^2 g}{\partial c_L^2}(c_L,c_R) >0\). Then \((c^{*}_L,c^{*}_R)\) minimizes \(g(c_L,c_R)\).
Remark 1
The previous theorem still holds if \(\theta >0\) almost everywhere in \([0,1]\).
4 Properties
In this section we study some properties of the approximation interval.
Proposition 1
The approximation interval
given by (1) satisfies the following properties:
-
(i)
invariance under translations, that is
$$\begin{aligned} C^{*}(A+z;f,\theta )=C^{*}(A;f,\theta )+z\qquad \forall z\in \mathbb {R}\,; \end{aligned}$$ -
(ii)
scale invariance, that is
$$\begin{aligned} C^{*}(z\cdot A;f,\theta )=z\cdot C^{*}(A;f,\theta )\qquad \forall \,z\in \mathbb {R}\!\setminus \!\!\{0\}\,. \end{aligned}$$
Proof
Let us prove (i). Since
and
from (1) we obtain
In a similar way, we get \(c^{*}_R(A+z;f,\theta )=c^{*}_R(A;f,\theta )+z\) and thus \(C^{*}(A+z;f,\theta )=C^{*}(A;f,\theta )+z\).
Let us prove (ii). First, we consider the case \(z>0\). We have
and thus
and
So from (1) we get
and thus
If \(z<0\) we have
and thus
Then from (1) we obtain
In the similar way, we get \(c^{*}_R(z\cdot A;f,\theta )=z\,c^{*}_L(A;f,\theta )\). Then, taking into account that \(z<0\), we have
5 Relation to Expected Interval and Interval-Valued Possibilistic Mean
Some important intervals connected with a fuzzy number are often utilized to have its view. We pertain to the expected interval \(EI(A)\) of a fuzzy number \(A\), introduced by Dubois and Prade [6] and Heilpern [11]
the interval-valued possibilistic mean introduced by Carlsson and Fullér [3]
and the \(f\) -weighted interval-valued possibilistic mean proposed by Fullér and Majlender [8] for monotonic increasing weighting functions and by Liu [12] without the monotonic increasing assumption
which is a generalization of the previous ones. It is interesting to see that there is an important connection between \(M_f(A)\) and the approximation interval \(C_{f,\theta }^{*}(A)=C^{*}(A;f,\theta )\) we have introduced before. As
and observed that from (1) we have
we get
and thus \(M_f(A)\) and \(C_{f,\theta }^{*}(A)\) have the same middle point independently of the choice of \(\theta \). Obviously, they may differ in their spreads. Thus, for a given weighting functions \(f\), they are all intervals centered at the same point but with different sizes. May we say something about these sizes? The following considerations reply to some questions.
To this aim, we consider the preference index value of the weighting function \(f\)
introduced in [12]. Similarly, we define the preference index value of the function \(\theta \cdot f\) as
and
First, we prove the following lemma.
Lemma 1
Let \(\tilde{f},\tilde{g}:[0,1]\rightarrow [0,+\infty [\) such that \(\int _{0}^{1}\tilde{f}(\alpha )\,d\alpha =1\), \(\int _{0}^{1}\tilde{g}(\alpha )\,d\alpha =1\) and
Then if \(h\) is an increasing function we have
if \(h\) is a decreasing function we have
Proof
We have
The assertions follow from (8).
Proposition 2
Let \(\theta _1,\theta _2:[0,1]\rightarrow ]0,1]\) such that
Then
and
Proof
If we choose
we obtain
It is trivial to see that as \(\theta _1\) and \(\theta _2\) verify (9) then even relation (8) is true. If in Lemma 1 we choose the increasing function \(h(\alpha )=\alpha \) we obtain
Moreover, if we choose the decreasing function \(h(\alpha )=spr(A_{\alpha })\) from Lemma 1 we get
Since \(\textit{mid}(C_{f,\theta _1}^*(A))=mid(C_{f,\theta _2}^*(A))\) we have \(C_{f,\theta _1}^*(A)\subseteq C_{f,\theta _2}^*(A)\).
Property (9) means that for \(\alpha \ge \gamma \) we have \(\frac{\theta _1(\alpha )}{\theta _1(\gamma )}\ge \frac{\theta _2(\alpha )}{\theta _2(\gamma )}\). Thus, if \(\theta _1\) increases faster than \(\theta _2\), the approximation interval will have a smaller spread.
Corollary 1
-
(i)
If \(\theta \) is constant then \(\varepsilon _{f}(\theta )= 0\) and \(C_{f,\theta }^*(A)= M_f(A)\);
-
(ii)
if \(\theta \) is a decreasing function then \(\varepsilon _{f}(\theta )\ge 0\) and \(C_{f,\theta }^*(A)\supseteq M_f(A)\);
-
(iii)
if \(\theta \) is an increasing function then \(\varepsilon _{f}(\theta )\le 0\) and \(C_{f,\theta }^*(A)\subseteq M_f(A)\).
Proof
Assertion (i) follows by observing that if \(\theta _1=\bar{\theta }\) is constant, with \(\bar{\theta }\in [0,1]\), then \(\varepsilon _{f}(\bar{\theta })= 0\) and \(C_{f,\bar{\theta }}^*(A)= M_f(A)\). To prove (ii), assume that \(\theta \) is decreasing. The functions \(\theta _1=\bar{\theta }\) (constant) and \(\theta _2=\theta \) satisfy the property (8). Thus, from Proposition 2 we have
and
Assertion (iii) follows in a similar way, assuming \(\theta \) increasing and applying Proposition 2 to the functions \(\theta _1=\theta \) and \(\theta _2=\bar{\theta }\).
6 Trapezoidal Fuzzy Numbers
In this section we are interested in showing some results for a nonmonotonic \(\theta \) to have a more evident connection between \(\varepsilon _{f}(\theta )\) and the approximation interval size. Starting with the particular case of a trapezoidal fuzzy number to reach our aims we present a particular parametric representation of \(\theta (\alpha )\) that includes the increasing, decreasing, and nonmonotonic case.
For a trapezoidal fuzzy number \(A\) the \(\alpha \)-cuts are
Observing that
we obtain from (2)
where \(e_f\) is defined in (5). Note that the \(f\)-weighted interval-valued possibilistic mean of a trapezoidal fuzzy number is the \(\alpha \)-cut at the level of the preference index value \(e_f\), that is \(M_f(A)=A_{e_f}=[a_L(e_f),a_R(e_f)]\). The approximation interval \(C_{f,\theta }^*(A)\) is given by
and, from (3),
where \(k_{f,\theta }\) is defined in (6). Observe that \(\textit{mid}(C_{f,\theta }^*(A))=mid(A_{e_f})\) and \(\textit{spr}(C_{f,\theta }^*(A))=spr(A_{k_{f,\theta }})\). Furthermore, the larger \(k_{f,\theta }\) is, the smaller the spread of approximation will be. We have from (7)
From (10) and (11) we obtain the following general result for trapezoidal fuzzy numbers
Proposition 3
-
(i)
If \(\varepsilon _{f}(\theta )=0\) then \(C_{f,\theta }^*(A)=M_f(A)\);
-
(ii)
if \(\varepsilon _{f}(\theta )>0\) then \(C_{f,\theta }^*(A)\supset M_f(A)\);
-
(iii)
if \(\varepsilon _{f}(\theta )<0\) then \(C_{f,\theta }^*(A)\subset M_f(A)\).
6.1 Example
Let us consider for \(0<\beta <1\), \(n>0\)
Note that if \(\beta =1/2\) we have \(\theta (\alpha )=\vert 1-2\alpha \vert ^{n}\).
Furthermore, we may consider the limit cases \(\beta =0\) corresponding to the increasing function \(\theta (\alpha )=\alpha ^n\), and \(\beta =1\) corresponding to the decreasing function \(\theta (\alpha )=(1-\alpha )^n\). In the following we will denote \(\varepsilon _{f}(n,\beta )=\varepsilon _{f}(\theta )\).
6.2 Case \(f(\alpha )=1\)
In the case \(f(\alpha )=1\) we have \(M_f(A)=EI(A)\) where \(EI(A)\) is the expected interval. We obtain
If \(C^{*}(A)=C^{*}(A;f,n,\beta )\) is the approximation interval, when \(n\rightarrow 0\) we have \(C^*(A)\rightarrow EI(A)\). From Proposition 3 we obtain by computation
-
(i)
\(\beta =1/2\implies \varepsilon _{f}(n,\beta )=0 \text{(for } \text{ all } n>0\text{) }\implies C^*(A)=EI(A)\),
-
(ii)
\(\beta >1/2\implies \varepsilon _{f}(n,\beta )>0 \text{(for } \text{ all } n>0\text{) }\implies C^*(A)\supset EI(A)\),
-
(iii)
\(\beta <1/2\implies \varepsilon _{f}(n,\beta )<0 \text{(for } \text{ all } n>0\text{) }\implies C^*(A)\subset EI(A)\).
Numerical example. To show how the interval approximation proposed works, we consider the symmetric trapezoidal fuzzy number \(A=(1,2,4,5)\) shown in Fig. 1 and compute the approximation interval of \(A\) for different values of parameters \(\beta \) and \(n\) when \(f(\alpha )=1\). By computation we obtain \(EI(A)=[\frac{3}{2},\frac{9}{2}]\), \(C^{*}(A)=C^{*}(A;f,n,\beta )=[c_L^*,c_R^*]=\left[ \frac{(2-\beta )n+3}{n+2},\frac{(4+\beta )n+9}{n+2}\right] \) and that the smaller \(\beta \) is, the smaller \(C^*(A)\) will be. Fig. 2a shows the approximation interval, in the case \(n=1\), for each level \(\beta \). When \(\beta =0.5\) we have \(C^*(A)=EI( A)\). In Fig. 2b we have represented the interval approximation if \(n=0\) (continuous line), \(n=1\) (dashed line), \(n=2\) (dotted line), \(n=\infty \) (dashed–dotted line). Note that when \(n=0\) we have \(C^*(A)=EI(A)\) and when \(n\rightarrow +\infty \) we have \(C^*(A)\rightarrow [2-\beta ,4+\beta ]\). Furthermore, \(n\) can be interpreted as an intensification parameter because when \(n\rightarrow +\infty \) we have \(C^*(A)\searrow \) if \(\beta <1/2\) and \(C^*(A)\nearrow \) if \(\beta >1/2\).
6.3 Case \(f(\alpha )=\alpha \)
In the case \(f(\alpha )=\alpha \) we have \(M_f(A)=M(A)\) where \(M(A)\) is the interval-valued possibilistic mean. We get
By computation we obtain that, for \(n>0\) fixed, the equation \(\varepsilon _{f}(n,\beta )=0\) has a unique solution in the interval \((0,1)\) given by
The solution \(\beta _{*}(n)\) is increasing with respect to \(n\), \(\lim _{n\rightarrow +\infty }\beta _*(n)=1\) and
From Proposition 3 we obtain
-
(i)
\(\beta =\beta _{*}(n)\implies \varepsilon _{f}(n,\beta )=0 \implies C^*(A)=M(A)\),
-
(ii)
\(\beta >\beta _{*}(n)\implies \varepsilon _{f}(n,\beta )>0 \implies C^*(A)\supset M(A)\),
-
(iii)
\(\beta <\beta _{*}(n)\implies \varepsilon _{f}(n,\beta )<0 \implies C^*(A)\subset M(A)\).
Remark 2
Note that for \(\beta =1/2\) in the case \(f(\alpha )=1\) we have \(C^*(A)=EI(A)\) and in the case \(f(\alpha )=\alpha \) we have \(C^*(A)\subset M(A)\).
7 Conclusion
In this paper we have seen a new generalization of the Trutschnig et al. distance to evaluate the nearest interval to a fuzzy number. We conclude that the classical interval connected with a fuzzy number as \(M_f(A)\) has the same middle point of the approximation interval we propose. So if we want to have the average value of a fuzzy number we may use the two methods indifferently. But if we want to have information on its ambiguity or other quantities connected with its spread, we obtain a different evaluation by working with the method we propose.
We are working in the direction to apply this result to the triangular and trapezoidal approximation of a fuzzy number.
References
Anzilli, L.: A possibilistic approach to investment decision making. Int. J. Uncertainty. Fuzziness Knowl. -Based Syst. 21, 201–221 (2013)
Bede, B.: Mathematics of Fuzzy Sets and Fuzzy Logic. Studies in Fuzziness and Soft Computing, Vol. 295. Springer (2013)
Carlsson, C., Fuller, R.: On possibilistic mean value and variance of fuzzy numbers. Fuzzy Sets Syst. 122, 315–326 (2001)
Chanas, S.: On the interval approximation of a fuzzy number. Fuzzy Sets Syst. 122, 353–356 (2001)
Delgado, M., Vila, M.A., Voxman, W.: On a canonical representation of a fuzzy number. Fuzzy Sets Syst. 93, 125–135 (1998)
Dubois, D., Prade, H.: The mean value of a fuzzy number. Fuzzy Sets Syst. 24, 279–300 (1987)
Facchinetti, G.: Ranking functions induced by weighted average of fuzzy numbers. Fuzzy Optim. Decis. Mak. 1, 313–327 (2002)
Fuller, R., Majlender, P.: On weighted possibilistic mean and variance of fuzzy numbers. Fuzzy Sets Syst. 136, 363–374 (2003)
Grzegorzewski, P.: Nearest interval approximation of a fuzzy number. Fuzzy Sets Syst. 130, 321–330 (2002)
Grzegorzewski, P.: On the interval approximation of fuzzy numbers. Advances in Computational Intelligence, 59–68. CCIS 299, Springer (2012)
Heilpern, S.: The expected value of a fuzzy number. Fuzzy Sets Syst. 47, 81–86 (1992)
Liu, X.: On the maximum entropy parameterized interval approximation of fuzzy numbers. Fuzzy Sets Syst. 157, 869–878 (2006)
Trutschnig, W., González-Rodrýguez, G., Colubi, A., Gil, M.A.: A new family of metrics for compact, convex (fuzzy) sets based on a generalized concept of mid and spread. Inf. Sci. 179, 3964–3972 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Anzilli, L., Facchinetti, G. (2015). A Parametric Interval Approximation of Fuzzy Numbers. In: Wiliński, A., Fray, I., Pejaś, J. (eds) Soft Computing in Computer and Information Science. Advances in Intelligent Systems and Computing, vol 342. Springer, Cham. https://doi.org/10.1007/978-3-319-15147-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-15147-2_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15146-5
Online ISBN: 978-3-319-15147-2
eBook Packages: EngineeringEngineering (R0)