Previous Article in Journal
Fuzzy Evaluation Model for Critical Components of Machine Tools
Previous Article in Special Issue
Some Applications of Fuzzy Sets in Residuated Lattices
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Different Types of Entropy Measures for Type-2 Fuzzy Sets

Departamento de Matemática Aplicada a las Tecnologías de la Información y las Comunicaciones, Universidad Politécnica de Madrid, Campus de Montegancedo, 28660 Boadilla del Monte, Madrid, Spain
*
Author to whom correspondence should be addressed.
Axioms 2024, 13(8), 556; https://doi.org/10.3390/axioms13080556
Submission received: 22 June 2024 / Revised: 27 July 2024 / Accepted: 6 August 2024 / Published: 14 August 2024
(This article belongs to the Special Issue Recent Advances in Fuzzy Sets and Related Topics)

Abstract

:
In this work, we consider De Luca and Termini’s notion of non-probabilistic entropy, and we extend some entropy-like measures of the degree of fuzziness to type-2 fuzzy sets. With this aim, we first study different entropy measures proposed in the frameworks of fuzzy, intuitionistic, and interval-valued fuzzy sets. Then, we propose three possible novel axiomatizations for entropy in type-2 fuzzy sets. The proposed types of entropy measures evaluate how much a type-2 fuzzy set is non-crisp, non-fuzzy, and non-interval-valued fuzzy. This can also be interpreted as how far a type-2 fuzzy set is from a crisp, fuzzy, or interval-valued fuzzy set. The present contribution is also novel, since we considered the interpretation of type-2 fuzzy sets that is closest to Zadeh’s original conception.
MSC:
03E72 (fuzzy set theory); 28E10 (fuzzy measure theory)

1. Introduction

The notion of entropy for a fuzzy set was initially studied by Zadeh in 1968 [1] in terms of a probability measure. Zadeh first introduced the concept of a fuzzy event from a fuzzy set and defined the probability of a fuzzy event as the expectation of its membership function. He then defined the entropy of a fuzzy set from probabilities as the usual definition of entropy in information theory. Subsequently, in 1972, De Luca and Termini introduced the novel concept of the non-probabilistic entropy of a fuzzy set [2]. Their aim was to find a measure of uncertainty, fuzziness, or entropy in fuzzy sets that did not depend on probabilities. To this end, they began by studying the axiomatic properties that any measure of entropy should satisfy. Consequently, they put forth the proposition that an entropy-like measure of the degree of fuzziness of a fuzzy set, denoted by d ( f ) (where d is a function from the set of fuzzy sets to the interval [ 0 , 1 ] , and f the membership degree function of a fuzzy set), should satisfy the following properties:
1.1
d ( f ) must be 0 if and only if f takes values 0 or 1.
1.2
d ( f ) must assume the maximum value if and only if f always assumes the value 1 2 .
1.3
d ( f ) must be greater than or equal to d ( f ) where f is any sharpened version of f, that is, any fuzzy set such that f ( x ) f ( x ) if f ( x ) 1 2 , and f ( x ) f ( x ) if f ( x ) < 1 2 .
The property “sharpened version of” induces a partial order 1 in the set of membership functions such that f 1 1 f 2 when f 1 is a sharpened version of f 2 . Therefore, d ( f ) is monotonically non-decreasing with respect to this order. The entropy then refers to the distance measured from the fuzzy set f to its most-sharpened version f defined as follows:
f ( x ) = 1 if f ( x ) 1 2 , 0 if f ( x ) < 1 2 .
This most-sharpened version transforms the fuzzy set into a crisp set. In fact, this is the closest crisp set to f, as illustrated in Figure 1.
This approach was also employed in [3], where Kaufmann defined an entropy measure as the distance between a fuzzy set and its nearest crisp set. However, other approaches to measuring the entropy of a fuzzy set have also been proposed. For instance, Yager [4,5] defined an entropy measure considering the distance between a fuzzy set and its complementary set. Other authors, such as Kosko [6] and Madrid and Ojeda [7], defined entropy measures using the notion of subsethood degree in fuzzy sets.
Later, two major contributions focused on the entropy of interval-valued fuzzy sets [8,9]. Both works agree on the introduction of an additional axiom that had not been considered by De Luca and Termini in their seminal work: the entropy of an interval-valued fuzzy set must be equal to the entropy of its complementary set. However, both works follow different approaches. Burillo and Bustince [8] quantify the dissimilarity between an interval-valued fuzzy set and a type-1 fuzzy set, whereas Zeng and Li [9] quantify the dissimilarity between an interval-valued fuzzy set and a crisp set. In other words, the former work by Burillo considers the entropy measure to be the distance from the membership degree (that is, an interval) to the closest [ a , a ] interval, while the latter work by Zeng considers the entropy measure to be the distance to the intervals [ 0 , 0 ] and [ 1 , 1 ] .
In this contribution, when comparing both proposals for the entropy in interval-valued fuzzy sets, we realized that these rely on different premises, that is, on a different set of axiomatic properties, which are mutually incompatible. Therefore, this implies that there exists at least two different types of entropy in these sets. Other approaches to the entropy of interval-valued fuzzy sets were proposed by Wu and Mendel [10], Liu and Cai [11], and Cornelis and Kerre [12].
The entropy of type-2 fuzzy sets has also been studied, see [13,14,15,16], but none of these works consider type-2 fuzzy sets as proposed by Mizumoto and Tanaka [17,18], more in line with Zaded’s initial conception [19], that is, where the membership degrees are labels of the variable truth. For instance, in [13,14,15], the authors consider the membership degrees of a type-2 fuzzy set simply as fuzzy sets. This is functionally equivalent to considering the type-2 fuzzy set as a type-1 fuzzy set defined in a two-dimensional domain, the second dimension being the interval [ 0 , 1 ] , that is, the space of membership degrees. With this approach, they have a different conception of what is the complementary set of a type-2 fuzzy set (as argued in [17]), and also of what is a type-2 fuzzy set with crisp membership degrees. These are central questions in the analysis of entropy; for instance, once introduced by the above-mentioned new axiom, the entropy of a fuzzy set must be equal to the entropy of its complementary set. Consequently, considering membership degrees as labels of the variable truth, or simply as type-1 fuzzy sets, will lead to a different interpretation of entropy.
In this work, we study the entropy of type-2 fuzzy sets considering sets as proposed by Mizumoto and Tanaka. To this end, we first analyze what has been done so far in the case of fuzzy sets and interval-valued fuzzy sets, then we describe the properties that it is reasonable to require of an entropy (including those related to the complementary set), and, finally, we propose three novel types of entropy measures for type-2 fuzzy sets. With each of the proposed types of entropy, we measure how much a type-2 fuzzy set is non-crisp, non-fuzzy, or non-interval-valued.
The remainder of this paper is organized as follows. In Section 2, we analyze entropy in interval-valued fuzzy sets. In a previous contribution [20], we already studied the works we considered most relevant and compared several entropy measures proposed for interval-valued fuzzy sets. Here, we revisit this work as it is the basis of the present study. In Section 3, we introduce type-2 fuzzy sets and use the ideas reviewed in the previous section to propose different types of entropy measures for these sets. Finally, we present our conclusions in Section 4.

2. Entropy in Interval-Valued Fuzzy Sets

Interval-valued fuzzy sets (IVFSs) are characterized by a membership function that assigns to each element of the universe a membership degree in the form of a closed subinterval of the unit interval [ 0 , 1 ] , instead of a single value in that interval, as is the case with fuzzy sets. That is,
μ A ( x ) = [ L A ( x ) , U A ( x ) ] x X ,
where 0 L A ( x ) U A ( x ) 1 .
In the following, we consider different definitions of entropy for IVFSs. However, it is important to note that some of the proposals considered were presented in the framework of intuitionistic fuzzy sets (IFSs), and not for IVFSs. Nevertheless, considering their formal equivalence [21], we analyze all of them from the IVFS point of view. Whether defined for IVFSs or IFSs, the nomenclature can be adapted, if necessary, by applying the following correspondence between an intuitionistic fuzzy set B and its counterpart in an IVFS, the set A, as described in [8]:
μ A ( x ) = [ L A ( x ) , U A ( x ) ] = [ η B ( x ) , 1 ν B ( x ) ] x X ,
where the membership degree of the intuitionistic fuzzy set B is σ B ( x ) = ( η B ( x ) , ν B ( x ) ) .
Burillo and Bustince [8] first adapted the axiomatization of a non-probabilistic entropy, as previously defined by De Luca and Termini for fuzzy sets, to both IVFS and IFS frameworks. In their approach, entropy is a tool to measure how far an interval-valued fuzzy set is from a fuzzy set. Thus, a fuzzy set (in which the membership value of each element of the universe is an interval reduced to a point) will have an entropy measure of 0, while the set whose membership values are all the interval [ 0 , 1 ] will have the maximum value, that is, 1 if the function is normalized. Let IVFS ( X ) denote the set of all interval-valued fuzzy sets in a finite universe X. Then, according to Burillo and Bustince, a function I : IVFS ( X ) [ 0 , 1 ] is an entropy measure on IVFS ( X ) if it satisfies the following axioms:
2.1
I ( A ) = 0 A is a fuzzy set, that is, μ A ( x ) [ 0 , 1 ] or, equivalently, L A ( x ) = U A ( x ) , x X .
2.2
I ( A ) = 1 μ A ( x ) = [ 0 , 1 ] , that is, L A ( x ) = 0 and U A ( x ) = 1 , x X .
2.3
I ( A ) = I ( A c ) , A c being the complementary set of A, where μ A c ( x ) = [ 1 U A ( x ) , 1 L A ( x ) ] , x X .
2.4
If A B (that is, [ L A ( x ) , U A ( x ) ] [ L B ( x ) , U B ( x ) ] , x X ), then I ( A ) I ( B ) .
Given that ⪯ is an order relation in IVFSs, Axiom 2.4 requires that any entropy measure that satisfies it must be monotonically non-decreasing with respect to that order.
An example of an entropy measure that satisfies these axiomatic properties is as follows:
I ( A ) = 1 N i = 1 N U A ( x i ) L A ( x i ) .
In a later work, Zeng and Li [9] modified this axiomatization in order to introduce different entropy measures in IVFSs. The proposed entropy is now a measure of how non-crisp an interval-valued fuzzy set is, that is, it measures how far the set is from being crisp. Then, according to Zeng and Li, a function E : IVFS ( X ) [ 0 , 1 ] is an entropy measure on IVFS ( X ) if it satisfies the following axioms:
3.1
E ( A ) = 0 A is a crisp set, that is, μ A ( x ) = [ 0 , 0 ] or μ A ( x ) = [ 1 , 1 ] , x X .
3.2
E ( A ) = 1 L A ( x ) + U A ( x ) = 1 , x X .
3.3
E ( A ) = E ( A c ) , A c being the complementary set of A.
3.4
If A B (that is, if L B ( x ) + U B ( x ) 1 , then L A ( x ) L B ( x ) and U A ( x ) U B ( x ) ; and if L B ( x ) + U B ( x ) 1 , then L A ( x ) L B ( x ) and U A ( x ) U B ( x ) ), then E ( A ) E ( B ) .
Again, considering that ≼ is an order relation in IVFSs, Axiom 3.4 requires that any entropy measure satisfying it must be monotonically non-decreasing with respect to the order ≼.
Several examples of entropy measures satisfying these other axioms can be found in the literature, but, in this contribution, we consider only three of them. First, the one proposed by Zeng and Li [9]:
E Z ( A ) = 1 1 N i = 1 N L A ( x i ) + U A ( x i ) 1 .
Second, the entropy measure proposed by Szmidt and Kacprzyk [22]. It should be noted that this proposal predates Zeng’s work, and although it was defined in the framework of IFSs, we have redefined it here for IVFSs.
E S ( A ) = 1 N i = 1 N 1 max ( 1 U A ( x i ) , L A ( x i ) ) 1 min ( 1 U A ( x i ) , L A ( x i ) ) .
Third, the following other entropy measure proposed by Vlachos and Sergiadis [23]:
E V ( A ) = 1 N i = 1 N min ( L A ( x i ) , 1 U A ( x i ) ) + min ( U A ( x i ) , 1 L A ( x i ) ) max ( L A ( x i ) , 1 U A ( x i ) ) + max ( U A ( x i ) , 1 L A ( x i ) ) .
Before analyzing the four entropy measures presented above, we consider it interesting to compare both sets of axioms and analyze the purpose of each one. First, comparing Axiom 2.1 and Axiom 3.1, we quickly realize that any fuzzy set has an entropy of 0 for Burillo, while only a crisp set has an entropy of 0 for Zeng. This was to be expected since, as explained above, Burillo measures how far an IVFS is from a fuzzy set (that is, how non-fuzzy it is) while Zeng measures how far an IVFS is from a crisp set (that is, how non-crisp it is). Furthermore, it is noteworthy that this also induces a completely different ordering in both entropy measures, as is shown in the following.
The orders considered in IVFSs are those defined on intervals. Let A = [ L A , U A ] and B = [ L B , U B ] be two intervals; we consider the following partial orders defined on intervals:
  • Contained order ( A B ) . It is said that A is contained in B if and only if L B L A U A U B .
  • Lattice order ( A B ) . It is said that A is lower than or equal to B if and only if L A L B and U A U B .
Let A and B now be two IVFSs, such that A ( x ) and B ( x ) are intervals. We can define two relations (partial orders) in IVFSs from contained and lattice orders, as follows:
  • Embedded. It is said that A is embedded in B if and only if A ( x ) B ( x ) , x X .
  • Included. It is said that A is included in B if and only if A ( x ) B ( x ) , x X .
It should be noted that both relations correspond to different situations. Inclusion means that the information given by one interval-valued fuzzy set (included in another) is less true than that given by the other. Embedding occurs when one interval-valued fuzzy set (the embedded one) has more precise information about the actual membership function than another.
Now, let us compare two IVFSs A and B with a fuzzy set C, where, for each x X , μ A ( x ) = [ L A ( x ) , U A ( x ) ] , μ B ( x ) = [ L B ( x ) , U B ( x ) ] , and μ C ( x ) = c , with c [ L A ( x ) , U A ( x ) ] and c [ L B ( x ) , U B ( x ) ] . Then, we have B A when [ L B ( x ) , U B ( x ) ] [ L A ( x ) , U A ( x ) ] , x X , that is, B is closer to C than A (see the top of Figure 2). Thus, to get closer to a fuzzy set, the interval contracts. According to the given definitions, this order is an embedding of IVFSs. This makes sense because embedding occurs when an interval-valued fuzzy set has more precise information, and, in such a case, the entropy should also be lower. For a deeper analysis of embedding in IVFSs, see [24].
On the other hand, let us now compare two IVFSs A and B with a crisp set C, that is, either μ C ( x ) = 0 or μ C ( x ) = 1 . Now, we have B A when L B ( x ) L A ( x ) , U B ( x ) U A ( x ) if L A ( x ) + U A ( x ) 1 (or L A ( x ) L B ( x ) , U A ( x ) U B ( x ) if L A ( x ) + U A ( x ) 1 ), that is, B is closer to 0 (or 1, respectively) than A (see center and bottom of Figure 2). Thus, to get closer to a crisp set, the whole interval shifts to the left (or right). This order is then based on the lattice order for intervals, but it is not an inclusion in IVFSs. That is because, when A is closer to 0 than B, A should be included in B, but when A is closer to 1 than B, B should be included in A. In both cases, the entropy of A will be lower than that of B, and, consequently, inclusion does not directly correlate with entropy.
Consequently, when analyzing the orders used in Axioms 2.4 and 3.4 to compare intervals, we realize that, for Burillo, two intervals are comparable only if one is inside the other (⊆), while for Zeng, two intervals are comparable only if one is shifted to the left (or right) of the other (≤). That is, assuming L A ( x ) < L B ( x ) , we obtain the following conditions:
1.
If U A ( x ) < U B ( x ) , then A and B are not comparable for ⪯.
2.
If U B ( x ) < U A ( x ) , then A and B are not comparable for ≼.
Therefore, for two intervals to be comparable in both approaches simultaneously, we need L A ( x ) = L B ( x ) or U A ( x ) = U B ( x ) .
Let us now compare the four entropy measures presented above. The entropy measures proposed by Burillo, Zeng, Szmidt, and Vlachos, originally defined in terms of the lower and upper bound of an interval, are here rewritten, now considering the interval in terms of its centroid and half-width, denoted by C A ( x ) and δ A ( x ) , respectively. Both centroid and half-width in terms of the lower and upper bounds of the interval are as follows:
C A ( x ) = L A ( x ) + U A ( x ) 2 ,
δ A ( x ) = U A ( x ) L A ( x ) 2 .
The function C A , which applies to each x X the value C A ( x ) , is referred to as the centroid function of A.
Therefore, an interval [ L A ( x ) , U A ( x ) ] can also be expressed in terms of centroid and half-width as [ C A ( x ) δ A ( x ) , C A ( x ) + δ A ( x ) ] . Furthermore, considering that the maximum value for δ A ( x ) is bounded by the distance to the closest endpoint of the interval, it is clear that
δ A ( x ) min ( C A ( x ) , 1 C A ( x ) ) .
New expressions for the four entropy measures can now easily be derived. Burillo’s entropy can then be rewritten as follows:
I ( A ) = 1 N i = 1 N ( U A ( x i ) L A ( x i ) ) = 1 N i = 1 N 2 δ A ( x i ) ,
Zeng’s entropy as
E Z ( A ) = 1 1 N i = 1 N L A ( x i ) + U A ( x i ) 1 = 1 1 N i = 1 N 2 C A ( x i ) 1 = 1 2 N i = 1 N C A ( x i ) 1 2 ,
Szmidt’s entropy as
E S ( A ) = 1 N i = 1 N 1 max ( 1 U A ( x i ) , L A ( x i ) ) 1 min ( 1 U A ( x i ) , L A ( x i ) ) = 1 N i = 1 N min ( C A ( x i ) , ( 1 C A ( x i ) ) ) + δ A ( x i ) max ( C A ( x i ) , ( 1 C A ( x i ) ) ) + δ A ( x i ) ,
and, finally, Vlachos’ entropy as
E V ( A ) = 1 N i = 1 N min ( L A ( x i ) , 1 U A ( x i ) ) + min ( U A ( x i ) , 1 L A ( x i ) ) max ( L A ( x i ) , 1 U A ( x i ) ) + max ( U A ( x i ) , 1 L A ( x i ) )
= 1 N i = 1 N min ( C A ( x i ) , 1 C A ( x i ) ) max ( C A ( x i ) , 1 C A ( x i ) ) .

Comparing Different Entropy Measures

With this reinterpretation of the four entropy measures, we can now easily analyze and compare I ( A ) , E Z ( A ) , E S ( A ) , and E V ( A ) considering the following propositions already introduced in [20].
Proposition 1. 
E S ( A ) E Z ( A ) A , with E S ( A ) = E Z ( A ) only when δ A ( x i ) = min ( C A ( x i ) , 1 C A ( x i ) ) i , that is, when, for every interval, either L A ( x i ) = 0 or U A ( x i ) = 1 .
Proposition 2. 
E V ( A ) E S ( A ) A , with E V ( A ) = E S ( A ) only when δ A ( x i ) = 0 i , that is, when working with a type-1 fuzzy set.
Proposition 3. 
I ( A ) E S ( A ) E Z ( A ) A , with I ( A ) = E S ( A ) = E Z ( A ) only when δ A ( x i ) = min ( C A ( x i ) , 1 C A ( x i ) ) i , that is, when, for every interval, either L A ( x i ) = 0 or U A ( x i ) = 1 .
In summary, it holds that
E V ( A ) E S ( A ) E Z ( A ) A ,
and
I ( A ) E S ( A ) A .
However, we cannot define an overall total order since, in some cases, we have I ( A ) < E V ( A ) , while in others we have E V ( A ) < I ( A ) (as shown in Example 1).
It should also be noted that, while I ( A ) considers only the width of the interval (the value 0 corresponds to intervals with δ A ( x i ) = 0 , that is, type-1 fuzzy sets), E Z ( A ) and E V ( A ) only refer to the centroid of the interval (the value 0 corresponds to intervals with C A ( x i ) { 0 , 1 } , that is, crisp sets). Instead, E S ( A ) considers both the centroid and width (the value 0 corresponds to intervals with C A ( x i ) { 0 , 1 } and, consequently, δ A ( x i ) = 0 , that is, again, crisp sets).
These ideas, together with the inequalities given by Equations (12) and (13), are illustrated in Figure 3 and Figure 4, and in Example 1.
First, Figure 3 shows two IVFSs (A and B) that have the same centroid function, that is, both produce the same closest type-1 fuzzy set (red dashed set in A). In fact, this type-1 fuzzy set is B. As a result E V ( A ) = E V ( B ) , E Z ( A ) = E Z ( B ) . However, at the same time, A being the IVFS with maximum fuzziness for this centroid function, and B being the IVFS with minimum fuzziness for this centroid function, we have that
I ( A ) = E S ( A ) = E Z ( A ) ,
and
I ( B ) = 0 , E S ( B ) = E V ( B ) .
Figure 4 illustrates how E V ( A ( x i ) ) E S ( A ( x i ) ) E Z ( A ( x i ) ) , and, consequently, how E V ( A ) E S ( A ) E Z ( A ) , A .
Finally, Example 1 considers different situations showcasing the previous ideas.
Example 1. 
Let A, B, and C be interval-valued fuzzy sets defined as follows:
A = { x 1 , [ 0 , 0 ] , x 2 , [ 0.4 , 0.4 ] , x 3 , [ 1 , 1 ] , x 4 , [ 0.6 , 0.6 ] , x 5 , [ 0 , 0 ] } , B = { x 1 , [ 0 , 0.4 ] , x 2 , [ 0.2 , 0.8 ] , x 3 , [ 0.5 , 1 ] , x 4 , [ 0.3 , 0.7 ] , x 5 , [ 0 , 0.5 ] } , C = { x 1 , [ 0 , 0.4 ] , x 2 , [ 0 , 0.8 ] , x 3 , [ 0.5 , 1 ] , x 4 , [ 0.2 , 1 ] , x 5 , [ 0 , 0.5 ] } .
For the set A, the entropy measures are
I ( A ) = 0 , E Z ( A ) = 1 1 5 ( 1 + 0.2 + 1 + 0.2 + 1 ) = 0.32 , E S ( A ) = 1 5 ( 0 + 2 3 + 0 + 2 3 + 0 ) = 4 15 = 0.27 , E V ( A ) = 1 5 ( 0 + 2 3 + 0 + 2 3 + 0 ) = 4 15 = 0.27 .
For the set B, they are
I ( B ) = 1 5 ( 0.4 + 0.6 + 0.5 + 0.4 + 0.5 ) = 0.48 , E Z ( B ) = 1 1 5 ( 0.6 + 0 + 0.5 + 0 + 0.5 ) = 0.68 , E S ( B ) = 1 5 ( 0.2 + 1 + 0.5 + 1 + 0.5 ) = 0.64 , E V ( B ) = 1 5 ( 0.25 + 1 + 1 3 + 1 + 1 3 ) = 7 12 = 0.58 .
Furthermore, finally, for the set C, they are
I ( C ) = 1 5 ( 0.4 + 0.8 + 0.5 + 0.8 + 0.5 ) = 0.6 , E Z ( C ) = 1 1 5 ( 0.6 + 0.2 + 0.5 + 0.2 + 0.5 ) = 0.6 , E S ( C ) = 1 5 ( 0.4 + 0.8 + 0.5 + 0.8 + 0.5 ) = 0.6 , E V ( C ) = 1 5 ( 0.25 + 2 3 + 1 3 + 2 3 + 1 3 ) = 0.45 .
Thus, we have that
I ( A ) < E V ( A ) = E S ( A ) < E Z ( A ) , I ( B ) < E V ( B ) < E S ( B ) < E Z ( B ) , E V ( C ) < I ( C ) = E S ( C ) = E Z ( C ) .
As expected, according to Equations (12) and (13), we see in these examples that the inequalities E V ( Y ) E S ( Y ) E Z ( Y ) and I ( Y ) E S ( Y ) , respectively, hold, while it is shown that there is no ordering between I ( Y ) and E V ( Y ) .

3. Entropy in Type-2 Fuzzy Sets

Type-2 fuzzy sets were introduced by Zadeh in 1975 [19] as an extension of fuzzy sets (type-1 fuzzy sets). A type-2 fuzzy set (T2FS), according to the definition given by Mizumoto and Tanaka [17,18], is a set A in which the membership degree of any element is a fuzzy set on [ 0 , 1 ] (see Figure 5). Therefore, it is determined by a membership function
μ A : X [ 0 , 1 ] [ 0 , 1 ] = Map ( [ 0 , 1 ] , [ 0 , 1 ] ) ,
that is, μ A ( x ) is a fuzzy set in the interval [ 0 , 1 ] and, also, the membership degree of an element x X to the set A. Equivalently, for any x X , μ A ( x ) (which we denote for convenience by μ ( x ) , as in Figure 5 ,   μ x or simply μ A ) is a function from [ 0 , 1 ] to [ 0 , 1 ] . In the following, we denote by T 2 FS ( X ) the set of all type-2 fuzzy sets in a finite universe X. It should be noted that, although throughout this paper we only consider entropy measures defined in a finite universe, the set of properties and entropy measures proposed here can be easily adapted to any universe.
It should be noted that it is possible to perceive the membership degrees of a T2FS as labels of the variable truth. In practical situations, these labels are usually normal (that is, sup { f ( x ) : x [ 0 , 1 ] } = 1 ) and convex (that is, for any x y z , it holds that f ( y ) f ( x ) f ( z ) ). In this work, we will only consider this type of label, and we will denote the set of all such labels by
L = { f [ 0 , 1 ] [ 0 , 1 ] : f normal and convex } .
The idea shown in Section 2, behind the definition of different entropy measures in interval-valued fuzzy sets, suggests the possibility of doing a similar approach in the case of type-2 fuzzy sets. Therefore, based on this idea, we first study how to introduce two different types of entropy measures by making a comparison between type-2 fuzzy sets and crisp or fuzzy sets. In other words, we want to study whether it is possible to find a measure of how non-crisp (or non-fuzzy) a type-2 fuzzy set is. Furthermore, in the case of type-2 fuzzy sets, we can also propose a third type of measure of how much a set is non-interval-valued.

3.1. Type-C Entropy in Type-2 Fuzzy Sets

In a first approach, we define the entropy of a T2FS as a measure of how much it is non-crisp, and we will refer to this entropy as Type-C, where C stands for crisp. Then, we begin by studying the entropy values at its endpoints (Axioms 3.1 and 3.2 proposed by Zeng, see Section 2). On the one hand, we assume that the entropy of a crisp set must be 0. Let us note that the membership degrees of a crisp T2FS could only be the singleton labels 0 ¯ or 1 ¯ :
  • 0 ¯ ( 0 ) = 1 and 0 ¯ ( y ) = 0 y [ 0 , 1 ] , y 0 ;
  • 1 ¯ ( 1 ) = 1 and 1 ¯ ( y ) = 0 y [ 0 , 1 ] , y 1 .
Thus, the entropy must be 0 when μ ( x ) = 0 ¯ or μ ( x ) = 1 ¯ , x X (as shown in Figure 6).
On the other hand, the entropy must take a maximum value when the set is as non-crisp as possible. That is, its labels should be as far away from the two singletons 0 ¯ and 1 ¯ as possible. Let μ ( x ) be a singleton a ¯ , that is, a ¯ ( a ) = 1 and a ¯ ( y ) = 0 , y [ 0 , 1 ] , y a . The one furthest from the singletons 0 ¯ and 1 ¯ is the singleton 1 2 ¯ . Thus, the entropy must be at least maximal when all the membership degrees are the singleton 1 2 ¯ .
Furthermore, we have to modify the order ≼ proposed by Zeng in Axiom 3.4 (see Section 2). This order, proposed for IVFSs, has to be adapted for the T2FS case. We then introduce the order ⊑, defined on the membership degrees of T2FS and characterized in the set L of functions from [ 0 , 1 ] to [ 0 , 1 ] , normal and convex (see [25,26]). To this end, we first introduce some auxiliary functions as in [25,26], give their properties and illustrate their meaning.
Definition 1 
([26]). Let f [ 0 , 1 ] [ 0 , 1 ] ; we define f L , f R [ 0 , 1 ] [ 0 , 1 ] as follows:
f L ( x ) = sup { f ( y ) : y x } , f R ( x ) = sup { f ( y ) : y x } .
It should be noted that f L and f R are monotonically increasing and decreasing, respectively, but it also holds that f f L , f f R , ( f L ) L = f L , and ( f R ) R = f R , for all f [ 0 , 1 ] [ 0 , 1 ] , where ≤ is the usual order in the set of functions (that is, f g if and only if f ( x ) g ( x ) ,   x [ 0 , 1 ] ). An example of both f L and f R is shown in Figure 7.
The following characterization of the partial order ⊑ on L was given in [25] (see Figure 8).
Theorem 1 
([25]). Let f , g L . Then, f g if and only if g L f L and f R g R .
Let us suppose now that the membership degree μ A in a T2FS is a characteristic function of an interval, that is, μ A = [ L A , U A ] ¯ such that μ A ( y ) = 1 when y [ L A , U A ] , and μ A ( y ) = 0 otherwise. Then, it is verified that (see Figure 9).
U A = y = 0 y = 1 ( μ A ) R ( y ) d y ,
L A = 1 y = 0 y = 1 ( μ A ) L ( y ) d y .
We then propose the following extension of the membership degree in IVFSs (that is, endpoints in an interval) to a membership degree in T2FSs. In other words, while in IVFSs we use the interval endpoints [ L A ( x i ) , U A ( x i ) ] to identify the membership degree, we propose to modify these endpoints to identify the membership degree in T2FSs as follows (see Figure 10):
1 y = 0 y = 1 ( μ A ( x i ) ) L ( y ) d y , y = 0 y = 1 ( μ A ( x i ) ) R ( y ) d y .
Similarly, the interval [ L B ( x i ) , U B ( x i ) ] is now as follows:
1 y = 0 y = 1 ( μ B ( x i ) ) L ( y ) d y , y = 0 y = 1 ( μ B ( x i ) ) R ( y ) d y .
Furthermore, the inequality L B ( x i ) + U B ( x i ) 1 in IVFSs becomes, in L ,
1 y = 0 y = 1 ( μ B ( x i ) ) L ( y ) d y + y = 0 y = 1 ( μ B ( x i ) ) R ( y ) d y 1 y = 0 y = 1 ( μ B ( x i ) ) L ( y ) d y y = 0 y = 1 ( μ B ( x i ) ) R ( y ) d y .
Thus, the relationship L A ( x i ) L B ( x i ) ; U A ( x i ) U B ( x i ) is now rewritten as μ A ( x i ) μ B ( x i ) . Finally, we can define the following order relation on T2FSs with membership degrees in L , that is, an extension of the order ≼ defined in Section 2.
Definition 2. 
Let A and B be type-2 fuzzy sets with membership degrees μ A ( x ) and μ B ( x ) , respectively, which are normal and convex functions for each x X . Then, A L R B if and only if x X the following conditions are met:
  • μ A ( x ) μ B ( x ) when y = 0 y = 1 ( μ B ( x ) ) L ( y ) d y > y = 0 y = 1 ( μ B ( x ) ) R ( y ) d y ;
  • μ A ( x ) = μ B ( x ) when y = 0 y = 1 ( μ B ( x ) ) L ( y ) d y = y = 0 y = 1 ( μ B ( x ) ) R ( y ) d y ;
  • μ B ( x ) μ A ( x ) when y = 0 y = 1 ( μ B ( x ) ) L ( y ) d y < y = 0 y = 1 ( μ B ( x ) ) R ( y ) d y .
It should be noted that, if y = 0 y = 1 ( μ B ( x ) ) L ( y ) d y > y = 0 y = 1 ( μ B ( x ) ) R ( y ) d y and μ A ( x ) μ B ( x ) , then
y = 0 y = 1 ( μ A ( x ) ) L ( y ) d y > y = 0 y = 1 ( μ A ( x ) ) R ( y ) d y ,
since
y = 0 y = 1 ( μ A ( x ) ) L ( y ) d y y = 0 y = 1 ( μ B ( x ) ) L ( y ) d y > y = 0 y = 1 ( μ B ( x ) ) R ( y ) d y y = 0 y = 1 ( μ A ( x ) ) R ( y ) d y .
Similarly, if y = 0 y = 1 ( μ B ( x ) ) R ( y ) d y > y = 0 y = 1 ( μ B ( x ) ) L ( y ) d y and μ B ( x ) μ A ( x ) , then
y = 0 y = 1 ( μ A ( x ) ) R ( y ) d y > y = 0 y = 1 ( μ A ( x ) ) L ( y ) d y .
Furthermore, it is easy to prove that the relation L R is antisymmetric and transitive.
Examples of both the partial order ⊑ in L and the order relation L R in T2FSs with membership degrees in L are illustrated in Figure 8 and Figure 11, respectively.
Next, based on what has been exposed above, we propose the following axiomatization.
Definition 3. 
Let A and B be type-2 fuzzy sets with membership degrees μ A ( x ) and μ B ( x ) , respectively, which are normal and convex functions for each x X . We say that a function E C : T 2 FS ( X ) [ 0 , 1 ] is a Type-C entropy measure on T 2 FS ( X ) if it satisfies the following axioms:
C.1
E C ( A ) = 0 μ A ( x ) = 0 ¯ or μ A ( x ) = 1 ¯ , x X .
C.2
E C ( A ) = 1 y = 0 y = 1 ( μ A ( x ) ) L ( y ) d y = y = 0 y = 1 ( μ A ( x ) ) R ( y ) d y , x X .
C.3
E C ( A ) = E C ( A c ) , A c being the complementary set of A, where ( μ A c ( x ) ) ( y ) = ( μ A ( x ) ) ( 1 y ) , x X , y [ 0 , 1 ] .
C.4
If A L R B , then E C ( A ) E C ( B ) .
It is at this point where considering membership degrees as labels of the variable truth, or simply as fuzzy sets, makes the difference. This question is considered in the following remarks.
Remark 1. 
Axiom C.1 considers that a type-2 fuzzy set with crisp membership degrees is one that has μ A ( x ) = 0 ¯ or μ A ( x ) = 1 ¯ , x X . This is consistent with the use of labels of the variable truth. On the other hand, when simply using fuzzy sets as membership degrees, a type-2 fuzzy set with crisp membership degrees is the one having ( μ A ( x ) ) ( y ) = 0 or ( μ A ( x ) ) ( y ) = 1 , x X , y [ 0 , 1 ] . This is functionally equivalent to considering the type-2 fuzzy set as a type-1 fuzzy set defined in a two-dimensional domain (the second dimension being the interval [ 0 , 1 ] ). Obviously, both interpretations differ.
Remark 2. 
Going now to Axiom C.3, considering membership degrees as labels of the variable truth will lead to a definition of the complementary set of a type-2 fuzzy set as ( μ A c ( x ) ) ( y ) = ( μ A ( x ) ) ( 1 y ) , x X , y [ 0 , 1 ] . On the other hand, considering membership degrees simply as fuzzy sets will lead to a complementary set (implicitly) defined as ( μ A c ( x ) ) ( y ) = 1 ( μ A ( x ) ) ( y ) , x X , y [ 0 , 1 ] . The point is that this is not the complementary, this is the negation of A (see [17]). Furthermore, that is the reason why some authors replace the axiom stating that “the entropy of a set and its complementary set should be equal”, with a new one stating that “the entropy of a set and its negated set should be equal”. However, this is not consistent with the definition of entropy for fuzzy sets and interval-valued fuzzy sets.
Some examples of entropy measures that satisfy Definition 3 are given below.
Proposition 4. 
Let A T 2 FS ( X ) be any type-2 fuzzy set on X, with a finite universe | X | = N , and membership degrees μ A ( x ) being normal and convex functions for each x X . The following functions are Type-C entropy measures on T 2 FS ( X ) :
E C Z ( A ) = 1 1 N i = 1 N F A R ( x i ) F A L ( x i ) ,
E C S ( A ) = 1 N i = 1 N min ( F A R ( x i ) , F A L ( x i ) ) max ( F A R ( x i ) , F A L ( x i ) ) ,
E C V ( A ) = 1 N i = 1 N min ( 1 F A L ( x i ) , 1 F A R ( x i ) ) + min ( F A R ( x i ) , F A L ( x i ) ) max ( 1 F A L ( x i ) , 1 F A R ( x i ) ) + max ( F A R ( x i ) , F A L ( x i ) ) ,
where
F A L ( x i ) = y = 0 y = 1 ( μ A ( x i ) ) L ( y ) d y ,
F A R ( x i ) = y = 0 y = 1 ( μ A ( x i ) ) R ( y ) d y ,
The proof of this proposition is given in the Appendix A.
It should be noted that we use the superscripts Z, S, and V for the three proposed Type-C entropy measures, because they are based on the original measures proposed for IVFSs by Zeng, Szmidt, and Vlachos, respectively. In fact, these entropy measures for T2FSs are extensions of the entropy measures E Z , E S , and E V given for IVFSs. We recall the extension of interval endpoints in IVFSs to T2FSs:
[ L A ( x i ) , U A ( x i ) ] 1 F A L ( x i ) , F A R ( x i ) .
With this transformation, we obtain the following extensions:
E Z ( A ) = 1 1 N i = 1 N U A ( x i ) ( 1 L A ( x i ) ) E C Z ( A ) = 1 1 N i = 1 N F A R ( x i ) F A L ( x i ) ,
E S ( A ) = 1 N i = 1 N min ( U A ( x i ) , 1 L A ( x i ) ) max ( U A ( x i ) , 1 L A ( x i ) ) E C S ( A ) = 1 N i = 1 N min ( F A R ( x i ) , F A L ( x i ) ) max ( F A R ( x i ) , F A L ( x i ) ) ,
and
E V ( A ) = 1 N i = 1 N min ( L A ( x i ) , 1 U A ( x i ) ) + min ( U A ( x i ) , 1 L A ( x i ) ) max ( L A ( x i ) , 1 U A ( x i ) ) + max ( U A ( x i ) , 1 L A ( x i ) ) E C V ( A ) = 1 N i = 1 N min ( 1 F A L ( x i ) , 1 F A R ( x i ) ) + min ( F A R ( x i ) , F A L ( x i ) ) max ( 1 F A L ( x i ) , 1 F A R ( x i ) ) + max ( F A R ( x i ) , F A L ( x i ) ) .
Remark 3. 
It should be noted that E C S ( A ) = E C V ( A ) when F A L ( x i ) + F A R ( x i ) = 1   i = 1 , , n (that is, μ A ( x i ) is a singleton and, thus, its integral is 0), and E C S ( A ) = E C Z ( A ) when F A L ( x i ) = 1 or F A R ( x i ) = 1 (that is, i = 1 , , n , μ A ( x i ) ( 0 ) = 1 or μ A ( x i ) ( 1 ) = 1 ).
Let us now compare these three entropy measures. First, without loss of generality, we suppose that
F A L ( x i ) = y = 0 y = 1 ( μ A ( x i ) ) L ( y ) d y < y = 0 y = 1 ( μ A ( x i ) ) R ( y ) d y = F A R ( x i ) .
It should be noted that, by symmetry, the result does not change if we assume the opposite, that is, F A R ( x i ) < F A L ( x i ) . It should also be noted that y = 0 y = 1 ( μ A ( x i ) ) ( y ) d y = F A R ( x i ) + F A L ( x i ) 1 , that is,
y = 0 y = 1 ( μ A ( x i ) ) ( y ) d y = y = 0 y = 1 ( μ A ( x i ) ) R ( y ) d y + y = 0 y = 1 ( μ A ( x i ) ) L ( y ) d y 1 .
Then, it holds that
min ( F A R ( x i ) , F A L ( x i ) ) max ( F A R ( x i ) , F A L ( x i ) ) = F A L ( x i ) F A R ( x i ) ,
and, also,
min ( 1 F A L ( x i ) , 1 F A R ( x i ) ) + min ( F A R ( x i ) , F A L ( x i ) ) max ( 1 F A L ( x i ) , 1 F A R ( x i ) ) + max ( F A R ( x i ) , F A L ( x i ) ) = = 1 F A R ( x i ) + F A L ( x i ) 1 F A L ( x i ) + F A R ( x i ) = 2 F A L ( x i ) y = 0 y = 1 ( μ A ( x i ) ) ( y ) d y 2 F A R ( x i ) y = 0 y = 1 ( μ A ( x i ) ) ( y ) d y .
Since y = 0 y = 1 ( μ A ( x i ) ) ( y ) d y F A L ( x i ) < F A R ( x i ) , it follows that
2 F A L ( x i ) y = 0 y = 1 ( μ A ( x i ) ) ( y ) d y 2 F A R ( x i ) y = 0 y = 1 ( μ A ( x i ) ) ( y ) d y 2 F A L ( x i ) 2 F A R ( x i ) = F A L ( x i ) F A R ( x i ) .
Therefore,
min ( 1 F A L ( x i ) , 1 F A R ( x i ) ) + min ( F A R ( x i ) , F A L ( x i ) ) max ( 1 F A L ( x i ) , 1 F A R ( x i ) ) + max ( F A R ( x i ) , F A L ( x i ) ) min ( F A R ( x i ) , F A L ( x i ) ) max ( F A R ( x i ) , F A L ( x i ) ) ,
that is, E C V ( A ) E C S ( A ) .
On the other hand, let us rewrite E C Z ( A ) as follows:
E C Z ( A ) = 1 1 N i = 1 N F A R ( x i ) F A L ( x i ) = 1 N i = 1 N 1 F A R ( x i ) F A L ( x i ) = 1 N i = 1 N 1 F A R ( x i ) + F A L ( x i ) ,
where the last equality holds, since F A L ( x i ) < F A R ( x i ) .
It is straightforward to verify that
F A L ( x i ) F A R ( x i ) 1 F A R ( x i ) + F A L ( x i ) .
Indeed, this implies that
F A L ( x i ) F A R ( x i ) F A R ( x i ) F A R ( x i ) + F A L ( x i ) F A R ( x i ) F A L ( x i ) F A L ( x i ) F A R ( x i ) F A R ( x i ) F A R ( x i ) F A R ( x i ) F A L ( x i ) ( 1 F A R ( x i ) ) F A R ( x i ) ( 1 F A R ( x i ) ) ,
which is satisfied since by the assumptions F A L ( x i ) < F A R ( x i ) and 0 F A L ( x i ) , F A R ( x i ) 1 . Therefore, the inequality E C S ( A ) E C Z ( A ) also holds.
In summary, it holds that
E C V ( A ) E C S ( A ) E C Z ( A ) A T 2 FS ( X ) .
It should be noted that this result is similar to the case of interval-valued fuzzy sets, in which E V ( A ) , E S ( A ) and E Z ( A ) , A IVFS ( X ) satisfy the same relation (see Section 2).
Example 2. 
Let X = { a , b , c } and χ : X [ 0 , 1 ] [ 0 , 1 ] , such that
χ ( a ) = χ a = 1 4 ¯ , χ ( b ) = χ b , where χ b ( y ) = 8 y 4 if 1 2 y 5 8 1 if 5 8 y 7 8 8 8 y if 7 8 y 1 0 elsewhere , χ ( c ) = χ c , where χ c ( y ) = 2 y if y 1 2 2 2 y if y 1 2 .
These membership degrees thus defined are illustrated in Figure 12.
Then,
F χ L ( a ) = y = 0 y = 1 ( χ ( a ) ) L ( y ) d y = 3 4 , F χ L ( b ) = 7 16 , F χ L ( c ) = 3 4 , F χ R ( a ) = y = 0 y = 1 ( χ ( a ) ) R ( y ) d y = 1 4 , F χ R ( b ) = 15 16 , F χ R ( c ) = 3 4 ,
and, thus, E C Z ( χ ) 0.666 , E C V ( χ ) 0.555 , and E C S ( χ ) = 0.6 .
In the example, it holds that E C V ( χ ) E C S ( χ ) E C Z ( χ ) , as expected since it was proved above for any type-2 fuzzy set; see Equation (26).

3.2. Type-F Entropy in Type-2 Fuzzy Sets

Following a different approach, we now redefine the entropy of a T2FS as a measure of how much the set is non-fuzzy, and we will refer to this entropy as Type-F, where F stands for fuzzy. Again, as in Section 3.1, we begin by studying the entropy at its endpoints. On the one hand, the entropy of a set must be 0 if it is indeed a fuzzy set, that is, the label associated with any element of the universe is a singleton. Then, x X , we have that μ A ( x ) = a ¯ with a [ 0 , 1 ] (as shown in Figure 13), that is,
( μ A ( x ) ) ( y ) = a ¯ ( y ) = 1 if y = a 0 if y a .
On the other hand, the entropy must take a maximum value when the membership degree of any element is as far from being a singleton as possible, that is, when the label 1 ( 0 , 1 ) is such that
1 ( 0 , 1 ) ( y ) = a [ 0 , 1 ] if y = 0 1 if 0 < y < 1 b [ 0 , 1 ] if y = 1 .
It should be noted that labels 1 ( 0 , 1 ) span a surface of area of 1, while singletons have an area of 0. Therefore, it seems intuitively reasonable that the larger the area of the membership degrees in a T2FS, the larger its entropy should be. Taking this into account, and given that, if one curve is below another, it implies that its area is smaller, we consider the following order relation on T2FSs with membership degrees in L .
Definition 4. 
Let A and B be type-2 fuzzy sets with membership degrees μ A ( x ) and μ B ( x ) , respectively, which are normal and convex functions for each x X . Then, A F B if μ A ( x ) μ B ( x ) , x X , where ≤ is the usual order in the set of functions (that is, μ A ( x ) μ B ( x ) if and only if ( μ A ( x ) ) ( y ) ( μ B ( x ) ) ( y ) , y [ 0 , 1 ] ).
This order is similar to the one considered by Burillo in [8] (only adapted to T2FSs). Therefore, the axiomatization we propose in the following could also be considered as an extension of the one proposed in [8].
Definition 5. 
Let A and B be type-2 fuzzy sets with membership degrees μ A ( x ) and μ B ( x ) , respectively, which are normal and convex functions for each x X . We say that a function E F : T 2 FS ( X ) [ 0 , 1 ] is a Type-F entropy measure on T 2 FS ( X ) if it satisfies the following axioms:
F.1
E F ( A ) = 0 μ A ( x ) = a ¯ for some a [ 0 , 1 ] , x X .
F.2
E F ( A ) = 1 y = 0 y = 1 ( μ A ( x ) ) ( y ) d y = 1 , x X .
F.3
E F ( A ) = E F ( A c ) .
F.4
If A F B , then E F ( A ) E F ( B ) .
An example for this entropy measure is as follows.
Proposition 5. 
Let A T 2 FS ( X ) be any type-2 fuzzy set on X, with a finite universe | X | = N , and membership degrees μ A ( x ) being normal and convex functions for each x X . The following function is a Type-F entropy measure on T 2 FS ( X ) :
E F ( A ) = 1 N i = 1 N y = 0 y = 1 ( μ A ( x i ) ) ( y ) d y .
We omit the proof of this proposition since it is almost straightforward and analogous to the proof of Proposition 4 (see Appendix A).
Let us remember how we modified the endpoints of an interval to extend it to the type-2 case in Section 3.1, Equation (22):
[ L A ( x i ) , U A ( x i ) ] 1 F A L ( x i ) , F A R ( x i ) .
It is then obvious that this entropy measure is an adapted version of I ( A ) proposed by Burillo for IVFSs, Equation (1), since it also considers the width of the interval. It should be noted that E F ( A ) also satisfies
E F ( A ) = 1 N i = 1 N F A R ( x i ) + F A L ( x i ) 1 .
Example 3. 
Using, again, the set of Example 2, we obtain
y = 0 y = 1 χ a ( y ) d y = 0 , y = 0 y = 1 χ b ( y ) d y = 3 8 , y = 0 y = 1 χ c ( y ) d y = 1 2 ,
and, thus,
E F ( χ ) = 1 3 0 + 3 8 + 1 2 = 1 3 · 7 8 = 7 24 .

3.3. Type-IV Entropy in Type-2 Fuzzy Sets

Finally, we define the entropy of a T2FS as a measure of how much it is a non-interval-valued fuzzy set, and we refer to this entropy as Type-IV, where IV stands for interval-valued. Again, we start by studying the entropy at its endpoints. On the one hand, it seems reasonable that the entropy must be 0 if all of the membership degrees are closed subintervals of [ 0 , 1 ] . However, to properly define this measure, it is necessary to consider for each membership value (that is, the linguistic label) which is the closest interval-valued fuzzy set. To do this, we set the values that are below 1 2 to be 0, and the other values that are greater than or equal to 1 2 to be 1 (see Figure 14).
Accordingly, the distance between a membership degree (or label) and its nearest IVFS must be maximum when almost all values are 1 2 (that is, up to a maximum of three values different from 1 2 are allowed, since the labels are convex and normal functions). Some of these maximum entropy sets are shown in Figure 15. Let F be the set of labels with almost all values equal to 1 2 . Specifically, labels in F may have only a maximum of three values that are not equal to 1 2 ; then,
F = f L : f ( y ) = 1 2 , y ( 0 , a ) ( a , 1 ) .
Furthermore, let F be the set of labels with 0 distance to its nearest interval-valued fuzzy set (see Figure 16):
F = f L : f = ( a , b ) ¯ ,
where
( a , b ) ¯ ( y ) = 0 if y [ 0 , a ) , c [ 0 , 1 ] if y = a , 1 if y ( a , b ) , d [ 0 , 1 ] if y = b , 0 if y ( b , 1 ] .
Next, we define the following order relation on T2FSs with membership degrees in L (see Figure 17).
Definition 6. 
Let A and B be type-2 fuzzy sets with membership degrees μ A ( x ) and μ B ( x ) , respectively, which are normal and convex functions for each x X . Then, A I V B if it is verified that x X , y [ 0 , 1 ] , the following conditions are met:
  • If ( μ B ( x ) ) ( y ) < 1 2 , then ( μ A ( x ) ) ( y ) ( μ B ( x ) ) ( y ) ;
  • If ( μ B ( x ) ) ( y ) = 1 2 , then ( μ A ( x ) ) ( y ) = ( μ B ( x ) ) ( y ) ;
  • If ( μ B ( x ) ) ( y ) > 1 2 , then ( μ A ( x ) ) ( y ) ( μ B ( x ) ) ( y ) .
Based on these considerations, we propose the following axiomatic properties for this entropy measure.
Definition 7. 
Let A and B be type-2 fuzzy sets with membership degrees μ A ( x ) and μ B ( x ) , respectively, which are normal and convex functions for each x X . We say that a function E I : T 2 FS ( X ) [ 0 , 1 ] is a Type-IV entropy measure on T 2 FS ( X ) if it satisfies the following axioms:
I.1
E I ( A ) = 0 μ A ( x ) F , x X .
I.2
E I ( A ) = 1 μ A ( x ) F , x X .
I.3
E I ( A ) = E I ( A c ) .
I.4
If A I V B , then E I ( A ) E I ( B ) .
An example of this entropy measure is as follows (see Figure 18).
Proposition 6. 
Let A T 2 FS ( X ) be any type-2 fuzzy set on X, with finite universe | X | = N , and membership degrees μ A ( x ) being normal and convex functions for each x X . The following function is a Type-IV entropy measure on T 2 FS ( X ) :
E I ( A ) = 2 N i = 1 N y = 0 y = 1 min ( ( μ A ( x ) ) ( y ) , 1 ( μ A ( x ) ) ( y ) ) d y .
Again, we omit the proof of this proposition, and, instead, we refer to the analogous proof of Proposition 4.
It should be noted that 2 y = 0 y = 1 min ( ( μ A ( x ) ) ( y ) , 1 ( μ A ( x ) ) ( y ) ) d y in E I ( A ) coincides with the expression in Example III. 1 proposed by De Miguel in [14] to obtain the entropy of a membership degree. However, it is a mere coincidence since their meanings are completely different. In [14], the entropy of a T2FS is defined as for a fuzzy set, that is, for each element x of the universe, the authors calculate the entropy of the membership degree of x, that is, the entropy of f x . Thus, they assign to each element x a measure of how much the function f x is not a crisp set. On the other hand, in the entropy that we consider here, we propose only one entropy value for the T2FS, and, with this aim, we assign to each element x a measure of how much its label f x is not an IVFS. It should be noted, for instance, that, while we interpret the image on the right side of Figure 14 as an IVFS, De Miguel would interpret it as a crisp set, and we find the same interpretation in [13,15].
Example 4. 
Using, once again, the set of Example 2, we have
y = 0 y = 1 m i n ( 1 χ a ( y ) , χ a ( y ) ) d y = 0 , y = 0 y = 1 m i n ( 1 χ b ( y ) , χ b ( y ) ) d y = 1 16 , y = 0 y = 1 m i n ( 1 χ c ( y ) , χ c ( y ) ) d y = 1 4 .
Thus,
E I ( χ ) = 2 3 0 + 1 16 + 1 4 = 5 24 .

3.4. Comparing the Different Measures

In the following two tables, we show eight very simple type-2 fuzzy sets corresponding to labels that are somehow close to the label “true” (named A to H, Table 1) and three type-2 fuzzy sets corresponding to labels that are close to the label “unknown” (named I to K, Table 2). For each one, we compute the five entropy measures presented in Section 3. In all cases, the universe X consists of a single element, that is X = { x } , and the respective membership degrees represent different labels of the variable truth. The labels in Table 1 range from “absolutely true” (A, the singleton 1 ¯ ) to “true”, considering values close to the singleton 1 ¯ (B and C), around the singleton 3 4 ¯ (D to G), and, finally, the label “true” (H). In Table 2, we get different potential expressions of the concept “unknown”.
In the tables, we can see how the entropy measures of Type C produce higher values as we move further away from “absolutely true” and get closer to “unknown” (exactly the same would happen if considering labels around “false” or closer to “unknown”). There, the maximum value for the Type-C entropy measures is obtained (Table 2). We can interpret this situation as considering an entropy that measures the uncertainty of the given information. We can assume that “absolutely true” and “absolutely false” represent the maximum certainty (value 0), while “unknown” represents the maximum uncertainty (value 1).
At the same time, it is easy to see that the entropy measures of Type F and Type I do not behave in a similar way. The entropy measure can be 0 even for the complete uncertainty represented by the label “true with degree 1 2 ”. These measures somehow analyze the dispersion of the set that represents the label. This property is usually referred to as imprecision, see [27], representing the area below the membership function. In that sense, a quite precise expression of complete uncertainty, like “true with degree 1 2 ”, will obtain an entropy measure of 0. Any singleton (no matter whether it represents true, false, or unknown) is considered precise and is assigned the value 0.
Therefore, we have two families of entropy measures that can be described as evaluating uncertainty (Type-C) and imprecision (Type-F and Type-I). Is there any difference inside each of the two families?
Entropy measures of Type C characterize uncertainty, but in the case of E C S , imprecision is also taken into account. The higher the imprecision, the higher the value of E C S , but always ranging between the value of E C V (obtained for minimum imprecision) and E C Z (obtained for maximum imprecision). In fact, all singletons in Table 1 (a singleton has an imprecision of 0, as said before) produce E C V = E C S (see A, D, and I in Table 1 and Table 2). On the other hand, for maximum imprecision (any set A such that x X , ( μ A ( x ) ) ( 0 ) = 1 or ( μ A ( x ) ) ( 1 ) = 1 ), we get E C S = E C Z (see A, B, C and H in Table 1).
Now considering entropy measures of Type F and I, while both of them consider imprecision, Type F measures imprecision as defined in the literature (area below the membership function), but Type I measures imprecision considering the area comprised between the membership function and either 0 or 1 (the closer value; see the shaded area in Figure 18).

4. Conclusions

The present paper extended to type-2 fuzzy sets (T2FSs) some entropy measures previously defined in the frameworks of fuzzy, intuitionistic, and interval-valued fuzzy sets (IVFSs). The analysis of those previous ideas offered insights for different approaches to study the entropy in T2FSs. Here, we considered three of those potential approaches, materialized in the novel proposal of three types of entropy measures. The main difference between these approaches relies on the reference set, that is, the set with minimum entropy (the set for which the entropy measure should take value 0). Three references were considered: crisp sets, fuzzy sets, and IVFSs. Thus, the first approach to entropy measures how much a T2FS is not a crisp set (how far from the closest crisp set it is). The second approach measures how far a T2FS is from being a fuzzy set. Finally, the third approach measures how far the T2FS is from being an IVFS (how far is the closest IVFS). These three approaches are described as entropy measures of Type-C, Type-F, and Type-IV, referring to crisp, fuzzy, and interval-valued fuzzy sets, respectively.
Moreover, all three proposals interpret T2FSs according to the structure proposed by Mizumoto and Tanaka [17], more in line with Zadeh’s original conception of a T2FS. In that sense, the membership degrees of the T2FS are considered as labels of the variable truth and not simply as two-dimensional type-1 fuzzy sets. Based on the proposed axiomatizations, several examples of entropy measures on T2FSs have been defined, extending to T2FSs the most commonly used entropy measures in fuzzy sets, and IVFSs.
Finally, for better understanding, we have illustrated each idea or key concept with drawings and examples throughout the paper, including an overall comparison through a final example.

Author Contributions

The authors L.M., C.T.-B., S.C. and J.M.-M. contributed equally to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This research has been partially supported by the Government of Spain (grants PID2021-122905NB-C22 and PID2020-112502RB-C41), Comunidad de Madrid (Convenio Plurianual con la Universidad Politécnica de Madrid en la línea de actuación Programa de Excelencia para el Profesorado Universitario).

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

Proof of Proposition 4.
Let us verify that the functions E C Z , E C S s and E C V satisfy the four Type-C entropy axioms for any A T 2 FS ( X ) .
Axiom C.1: Let μ A ( x i ) = 0 ¯ or μ A ( x i ) = 1 ¯ , x i X . If μ A ( x i ) = 0 ¯ , then
F A L ( x i ) = y = 0 y = 1 0 ¯ L ( y ) d y = 1 , F A R ( x i ) = y = 0 y = 1 0 ¯ R ( y ) d y = 0 .
Otherwise, if μ A ( x i ) = 1 ¯ , then
F A L ( x i ) = y = 0 y = 1 1 ¯ L ( y ) d y = 0 , F A R ( x i ) = y = 0 y = 1 1 ¯ R ( y ) d y = 1 .
Thus, E C Z ( A ) = 0 , E C S ( A ) = 0 and E C V ( A ) = 0 .
In contrast, let E C Z ( A ) = 0 . Then, 1 N i = 1 N F A R ( x i ) F A L ( x i ) = 1 . Since 0 F A R ( x i ) 1 and 0 F A L ( x i ) 1 , it follows that 0 F A R ( x i ) F A L ( x i ) 1 , and, hence, it must hold that F A R ( x i ) F A L ( x i ) = 1 , x i X . Then, we have that F A R ( x i ) = 1 and F A L ( x i ) = 0 , or F A R ( x i ) = 0 and F A L ( x i ) = 1 . Therefore, μ A ( x i ) = 1 ¯ or μ A ( x i ) = 0 ¯ , x i X .
Let E C S ( A ) = 0 , that is,
1 N i = 1 N min ( F A R ( x i ) , F A L ( x i ) ) max ( F A R ( x i ) , F A L ( x i ) ) = 0 .
Then, F A R ( x i ) = 0 or F A L ( x i ) = 0 , x i X . Therefore, necessarily, μ A ( x i ) = 0 ¯ or μ A ( x i ) = 1 ¯ , x i X .
Similarly, let E C V ( A ) = 0 , that is,
i = 1 N min ( 1 F A L ( x i ) , 1 F A R ( x i ) ) + min ( F A R ( x i ) , F A L ( x i ) ) max ( 1 F A L ( x i ) , 1 F A R ( x i ) ) + max ( F A R ( x i ) , F A L ( x i ) ) = 0 .
Then, μ A ( x i ) = 0 ¯ or μ A ( x i ) = 1 ¯ , x i X . Thus, Axiom C.1 follows.
Axiom C.2: Let F A R ( x i ) = F A L ( x i ) , x i X . It is straightforward to see that E C Z ( A ) = E C S ( A ) = E C V ( A ) = 1 .
Conversely, let E C Z ( A ) = 1 . Then, 1 N i = 1 N F A R ( x i ) F A L ( x i ) = 0 . Since F A R ( x i ) F A L ( x i ) 0 , it follows that F A R ( x i ) F A L ( x i ) = 0 , x i X , and, hence, F A R ( x i ) = F A L ( x i ) , x i X .
Next, let E C S ( A ) = 1 , and we denote
Δ ( x i ) = min ( F A R ( x i ) , F A L ( x i ) ) max ( F A R ( x i ) , F A L ( x i ) ) .
Since Δ ( x i ) 1 , it necessarily has to be Δ ( x i ) = 1 , x i X . Therefore, F A R ( x i ) = F A L ( x i ) , x i X .
Finally, let E C V ( A ) = 1 . Then, x i X ,
min ( 1 F A L ( x i ) , 1 F A R ( x i ) ) + min ( F A R ( x i ) , F A L ( x i ) ) max ( 1 F A L ( x i ) , 1 F A R ( x i ) ) + max ( F A R ( x i ) , F A L ( x i ) ) = 1 .
Assuming that min ( F A R ( x i ) , F A L ( x i ) ) = F A L ( x i ) ,
1 F A R ( x i ) + F A L ( x i ) 1 F A L ( x i ) ) + F A R ( x i ) = 1 ,
and, hence, F A L ( x i ) = F A R ( x i ) .
Similarly, assuming that min ( F A R ( x i ) , F A L ( x i ) ) = F A R ( x i ) , then F A L ( x i ) = F A R ( x i ) .
Thus, Axiom C.2 follows.
Axiom C.3: First, we prove F A c L ( x i ) = F A R ( x i ) , x i X . That is,
F A c L ( x i ) = y = 0 y = 1 ( μ A c ( x i ) ) L ( y ) d y = y = 0 y = 1 sup { ( μ A c ( x i ) ) ( z ) : z y } d y = y = 0 y = 1 sup { ( μ A ( x i ) ) ( 1 z ) : z y } d y = y = 0 y = 1 sup { ( μ A ( x i ) ) ( 1 z ) : 1 z 1 y } d y = y = 0 y = 1 sup { ( μ A ( x i ) ) ( z ) : z 1 y } d y = y = 0 y = 1 ( μ A ( x i ) ) R ( 1 y ) d y = z = 1 z = 0 ( μ A ( x i ) ) R ( z ) ( d z ) = z = 0 z = 1 ( μ A ( x i ) ) R ( z ) d z = F A R ( x i ) .
Similarly, we can prove that F A c R ( x i ) = F A L ( x i ) . Thus, Axiom C.3 follows.
Axiom C.4: Let A L R B . Assuming that F B L ( x i ) > F B R ( x i ) , x i X . Then, μ A ( x i ) μ B ( x i ) , and, hence, F A L ( x i ) F B L ( x i ) > F B R ( x i ) F A R ( x i ) , that is,
F A L ( x i ) F A R ( x i ) F B L ( x i ) F B R ( x i ) F A R ( x i ) F A L ( x i ) F B R ( x i ) F L R ( x i )
and also,
1 F A R ( x i ) F A L ( x i ) 1 F B R ( x i ) F L R ( x i ) x i X .
Thus, E C Z ( A ) E C Z ( B ) . Moreover,
min ( F A R ( x i ) , F A L ( x i ) ) = F A R ( x i ) F B R ( x i ) = min ( F B R ( x i ) , F B L ( x i ) ) ,
max ( F A R ( x i ) , F A L ( x i ) ) = F A L ( x i ) F B L ( x i ) = max ( F B R ( x i ) , F B L ( x i ) ) .
Thus, E C S ( A ) E C S ( B ) . Finally,
min ( 1 F A L ( x i ) , 1 F A R ( x i ) ) = 1 F A L ( x i ) 1 F B L ( x i ) = min ( 1 F B L ( x i ) , 1 F B R ( x i ) ) ,
max ( 1 F A L ( x i ) , 1 F A R ( x i ) ) = 1 F A R ( x i ) 1 F B R ( x i ) = max ( 1 F B L ( x i ) , 1 F B R ( x i ) ) .
Thus, E C V ( A ) E C V ( B ) .
Similarly, assuming that F B R ( x i ) > F B L ( x i ) , x i X . Then, μ B ( x i ) μ A ( x i ) , that is, F A R ( x i ) F B R ( x i ) > F B L ( x i ) F A L ( x i ) , and the inequality E C Z ( A ) E C Z ( B ) also follows.
Therefore, Axiom C.4 and the proposition follow. □

References

  1. Zadeh, L.A. Probability measures of Fuzzy events. J. Math. Anal. Appl. 1968, 23, 421–427. [Google Scholar] [CrossRef]
  2. De Luca, A.; Termini, S. A definition of a nonprobabilistic entropy in the setting of fuzzy sets theory. Inf. Control 1972, 20, 301–312. [Google Scholar] [CrossRef]
  3. Kaufmann, A. Introduction to the Theory of Fuzzy Subsets; Academic Press: Cambridge, MA, USA, 1975. [Google Scholar]
  4. Yager, R.R. On the Measure of Fuzziness and Negation Part I: Membership in the Unit Interval. Int. J. Gen. Syst. 1979, 5, 221–229. [Google Scholar] [CrossRef]
  5. Yager, R.R. On the measure of fuzziness and negation. II. Lattices. Inf. Control 1980, 44, 236–260. [Google Scholar] [CrossRef]
  6. Kosko, B. Fuzzy entropy and conditioning. Inf. Sci. 1986, 40, 165–174. [Google Scholar] [CrossRef]
  7. Madrid, N.; Ojeda-Aciego, M. Measures of inclusion and entropy based on the φ-index of inclusion. Fuzzy Sets Syst. 2021, 423, 29–54. [Google Scholar] [CrossRef]
  8. Burillo, P.; Bustince, H. Entropy on intuitionistic fuzzy sets and on interval-valued fuzzy sets. Fuzzy Sets Syst. 1996, 78, 305–316. [Google Scholar] [CrossRef]
  9. Zeng, W.; Li, H. Relationship between similarity measure and entropy of interval valued fuzzy sets. Fuzzy Sets Syst. 2006, 157, 1477–1484. [Google Scholar] [CrossRef]
  10. Wu, D.; Mendel, J.M. Uncertainty measures for interval type-2 fuzzy sets. Inf. Sci. 2007, 177, 5378–5393. [Google Scholar] [CrossRef]
  11. Liu, S.; Cai, R. Uncertainty of Interval Type-2 Fuzzy Sets Based on Fuzzy Belief Entropy. Entropy 2021, 23, 1265. [Google Scholar] [CrossRef] [PubMed]
  12. Cornelis, C.; Kerre, E.E. Inclusion Measures in Intuitionistic Fuzzy Set Theory. In Symbolic and Quantitative Approaches to Reasoning with Uncertainty; ECSQARU 2003; Lecture Notes in Computer Science; Nielsen, T., Zhang, N., Eds.; Springer: Berlin/Heidelberg, Germany, 2003; Volume 2711, pp. 345–356. [Google Scholar]
  13. Hwang, C.M.; Yang, M.S.; Hung, W.L.; Stanley Lee, E. Similarity, inclusion and entropy measures between type-2 fuzzy sets based on the Sugeno integral. Math. Comput. Model. 2011, 53, 1788–1797. [Google Scholar] [CrossRef]
  14. De Miguel, L.; Santos, H.; Sesma-Sara, M.; Bedregal, B.; Jurio, A.; Bustince, H.; Hagras, H. Type-2 fuzzy entropy sets. IEEE Trans. Fuzzy Syst. 2017, 25, 993–1005. [Google Scholar] [CrossRef]
  15. Qin, J.; Xu, T.; Zheng, P. Axiomatic framework of entropy measure for type-2 fuzzy sets with new representation method and its application to product ranking through online reviews. Appl. Soft. Comput. 2022, 130, 109689. [Google Scholar] [CrossRef]
  16. Yao, D.; Liu, X.; Zhang, X.; Wang, C. Type-2 fuzzy cross-entropy and entropy measures and Their Applications. J. Intell. Fuzzy Syst. 2016, 30, 2169–2180. [Google Scholar] [CrossRef]
  17. Mizumoto, M.; Tanaka, K. Some properties of fuzzy sets of type 2. Inf. Control 1976, 31, 312–340. [Google Scholar] [CrossRef]
  18. Mizumoto, M.; Tanaka, K. Fuzzy sets of type-2 under algebraic product and algebraic sum. Fuzzy Sets Syst. 1981, 5, 277–290. [Google Scholar] [CrossRef]
  19. Zadeh, L. The concept of a linguistic variable and its application to approximate reasoning—I. Inf. Sci. 1975, 8, 199–249. [Google Scholar] [CrossRef]
  20. Magdalena, L.; Cubillo, S.; Torres-Blanc, C. Comparing different approaches to entropy for Interval Valued Fuzzy Sets. In Proceedings of the IEEE International Conference on Fuzzy Systems, Incheon, Republic of Korea, 13–17 August 2023; pp. 1–8. [Google Scholar]
  21. Cornelis, C.; Deschrijver, G.; Kerre, E.E. Implication in intuitionistic fuzzy and interval-valued fuzzy set theory: Construction, classification, application. Int. J. Approx. Reason. 2004, 35, 55–95. [Google Scholar] [CrossRef]
  22. Szmidt, E.; Kacprzyk, J. Entropy for intuitionistic fuzzy sets. Fuzzy Sets Syst. 2001, 118, 467–477. [Google Scholar] [CrossRef]
  23. Vlachos, I.K.; Sergiadis, G.D. Subsethood, entropy, and cardinality for interval-valued fuzzy sets—An algebraic derivation. Fuzzy Sets Syst. 2007, 158, 1384–1396. [Google Scholar] [CrossRef]
  24. Bouchet, A.; Sesma-Sara, M.; Ochoa, G.; Bustince, H.; Montes, S.; Díaz, I. Measures of embedding for interval-valued fuzzy sets. Fuzzy Sets Syst. 2023, 467, 108505. [Google Scholar] [CrossRef]
  25. Harding, J.; Walker, C.; Walker, E. Lattices of convex normal functions. Fuzzy Sets Syst. 2008, 159, 1061–1071. [Google Scholar] [CrossRef]
  26. Walker, C.L.; Walker, E.A. The algebra of fuzzy truth values. Fuzzy Sets Syst. 2005, 149, 309–347. [Google Scholar] [CrossRef]
  27. Gonzalez, A.; Pons, O.; Vila, M. Dealing with uncertainty and imprecision by means of fuzzy numbers. Int. J. Approx. Reason. 1999, 21, 233–256. [Google Scholar] [CrossRef]
Figure 1. A fuzzy set f (left) and its most-sharpened version f (right).
Figure 1. A fuzzy set f (left) and its most-sharpened version f (right).
Axioms 13 00556 g001
Figure 2. Orders in intervals (Intervals A in blue and B in red). The top shows the interval order for the relationship B A , while the center and bottom show the interval order for relationship B A .
Figure 2. Orders in intervals (Intervals A in blue and B in red). The top shows the interval order for the relationship B A , while the center and bottom show the interval order for relationship B A .
Axioms 13 00556 g002
Figure 3. Two IVFSs with the same centroid function: A with maximum width of intervals (centroid function represented in red) and B with minimum width of intervals.
Figure 3. Two IVFSs with the same centroid function: A with maximum width of intervals (centroid function represented in red) and B with minimum width of intervals.
Axioms 13 00556 g003
Figure 4. Ordering among entropy measures E Z (upper curve), E S (taking values in the shaded area), and E V (lower curve) with respect to centroid.
Figure 4. Ordering among entropy measures E Z (upper curve), E S (taking values in the shaded area), and E V (lower curve) with respect to centroid.
Axioms 13 00556 g004
Figure 5. Example of a T2FS with discrete universe X = { 0 , 1 , 2 , 3 , 4 } .
Figure 5. Example of a T2FS with discrete universe X = { 0 , 1 , 2 , 3 , 4 } .
Axioms 13 00556 g005
Figure 6. Crisp type-2 fuzzy set.
Figure 6. Crisp type-2 fuzzy set.
Axioms 13 00556 g006
Figure 7. Example of f L and f R (solid lines).
Figure 7. Example of f L and f R (solid lines).
Axioms 13 00556 g007
Figure 8. Example where f g (f solid line and g dashed line).
Figure 8. Example where f g (f solid line and g dashed line).
Axioms 13 00556 g008
Figure 9. Reinterpreting U A and L A in terms of the area (shaded region) under the curves μ A R and μ A L , that is, the integral in Equations (16) and (15), μ A being the characteristic function of an interval.
Figure 9. Reinterpreting U A and L A in terms of the area (shaded region) under the curves μ A R and μ A L , that is, the integral in Equations (16) and (15), μ A being the characteristic function of an interval.
Axioms 13 00556 g009
Figure 10. Areas (shaded regions) under the curves μ A R and μ A L (solid lines).
Figure 10. Areas (shaded regions) under the curves μ A R and μ A L (solid lines).
Axioms 13 00556 g010
Figure 11. Examples where A L R B (A dashed line and B solid line).
Figure 11. Examples where A L R B (A dashed line and B solid line).
Axioms 13 00556 g011
Figure 12. Membership degrees in the type-2 fuzzy set of Example 2.
Figure 12. Membership degrees in the type-2 fuzzy set of Example 2.
Axioms 13 00556 g012
Figure 13. Type-2 fuzzy set being a fuzzy set.
Figure 13. Type-2 fuzzy set being a fuzzy set.
Axioms 13 00556 g013
Figure 14. Membership degrees of a type-2 fuzzy set (left) and its nearest interval-valued fuzzy set (right).
Figure 14. Membership degrees of a type-2 fuzzy set (left) and its nearest interval-valued fuzzy set (right).
Axioms 13 00556 g014
Figure 15. Labels with maximum distance to their nearest interval-valued fuzzy set.
Figure 15. Labels with maximum distance to their nearest interval-valued fuzzy set.
Axioms 13 00556 g015
Figure 16. Labels with 0 distance to their nearest interval-valued fuzzy set.
Figure 16. Labels with 0 distance to their nearest interval-valued fuzzy set.
Axioms 13 00556 g016
Figure 17. Example of A I V B (A solid line and B dashed line).
Figure 17. Example of A I V B (A solid line and B dashed line).
Axioms 13 00556 g017
Figure 18. The shaded area represents the distance between a label (or membership degree in a T2FS, dashed line) and its nearest interval fuzzy set.
Figure 18. The shaded area represents the distance between a label (or membership degree in a T2FS, dashed line) and its nearest interval fuzzy set.
Axioms 13 00556 g018
Table 1. Comparing measures of entropy for labels close to “true”.
Table 1. Comparing measures of entropy for labels close to “true”.
E C V ( χ ) E C S ( χ ) E C Z ( χ ) E F ( χ ) E I ( χ )
A = { x , t r u e   w i t h   d e g r e e 1 }
= { x , μ A ( x ) = 1 ¯ } (singleton)
00000
B = { x , t r u e   w i t h   d e g r e e   a p p r o x i m a t e l y 1 }
= { x , μ B ( x ) = [ 3 4 , 1 , 1 , 1 ] } (triangle)
1 15 1 8 1 8 1 8 1 8
C = { x , t r u e   w i t h   d e g r e e   g r e a t e r   t h a n   3 4 }
= { x , μ C ( x ) = [ 3 4 , 1 ] ¯ } (interval)
1 7 1 4 1 4 1 4 0
D = { x , t r u e   w i t h   d e g r e e   3 4 }
= { x , μ D ( x ) = 3 4 ¯ } (singleton)
1 3 1 3 1 2 00
E = { x , t r u e   w i t h   d e g r e e   a p p r o x i m a t e l y   3 4 }
= { x , μ E ( x ) = [ 5 8 , 3 4 , 3 4 , 7 8 ] } (triangle)
1 3 5 13 1 2 1 8 1 8
F = { x , t r u e   w i t h   d e g r e e   [ 5 8 ,   7 8 ] }
= { x , μ F ( x ) = [ 5 8 , 7 8 ] ¯ } (interval)
1 3 3 7 1 2 1 4 0
G = { x , t r u e   w i t h   d e g r e e   a p p r o x .   [ 5 8 ,   7 8 ] }
= { x , μ G ( x ) = [ 1 2 , 5 8 , 7 8 , 1 ] } (trapezoid)
1 3 7 15 1 2 3 8 1 8
H = { x , t r u e } (triangle)
= { x , ( μ H ( x ) ) ( y ) = y }
1 3 1 2 1 2 1 2 1 2
Table 2. Comparing measures of entropy for labels close to “unknown”.
Table 2. Comparing measures of entropy for labels close to “unknown”.
E C V ( χ ) E C S ( χ ) E C Z ( χ ) E F ( χ ) E I ( χ )
I = { x , t r u e   w i t h   d e g r e e   1 2 }
= { x , μ I ( x ) = 1 2 ¯ } (singleton)
11100
J = { x , n o t   v e r y   t r u e   a n d   n o t   v e r y   f a l s e }
= { x , μ J ( x ) = [ 0 , 1 2 , 1 2 , 1 ] } (triangle)
111 1 2 1 2
K = { x , l a c k   o f   i n f o r m a t i o n   ( u n k n o w n ) }
= { x , μ K ( x ) = [ 0 , 1 ] ¯ } (interval)
11110
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Magdalena, L.; Torres-Blanc, C.; Cubillo, S.; Martinez-Mateo, J. Different Types of Entropy Measures for Type-2 Fuzzy Sets. Axioms 2024, 13, 556. https://doi.org/10.3390/axioms13080556

AMA Style

Magdalena L, Torres-Blanc C, Cubillo S, Martinez-Mateo J. Different Types of Entropy Measures for Type-2 Fuzzy Sets. Axioms. 2024; 13(8):556. https://doi.org/10.3390/axioms13080556

Chicago/Turabian Style

Magdalena, Luis, Carmen Torres-Blanc, Susana Cubillo, and Jesus Martinez-Mateo. 2024. "Different Types of Entropy Measures for Type-2 Fuzzy Sets" Axioms 13, no. 8: 556. https://doi.org/10.3390/axioms13080556

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop