1. Introduction
According to Chen et al., granular computing is a general computing theory for using granules such as classes, clusters, subsets, groups and intervals to build an efficient computational model for complex applications with huge amounts of data, information and knowledge [
1].
Rough set theory [
2], proposed by Pawlak in 1982, can be used to reveal and express knowledge hidden in information systems in the form of decision rules by the concepts of lower and upper approximations. Here, equivalence classes are used as the basic granules to express the lower and upper approximations. Taken in this sense, rough set theory is a granular computing method.
Traditional rough set theory only manipulated decision systems with symbolic attribute values, whereas in some real-world applications, the values of attributes could be both symbolic and real-valued. In 1990, Dubois and Prade [
3] proposed the definition of fuzzy rough sets by combining fuzzy sets and rough sets, then many studies were carried out in the field of fuzzy rough sets [
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14]. In [
15], fuzzy rough sets were applied to feature selection for the first time. Wu et al. studied the generalized fuzzy rough sets using both constructive and axiomatic approaches [
16,
17]. Mi and Zhang [
18] introduced the definitions of generalized fuzzy lower and upper approximation operators determined by a residual implication and studied the composition of two approximation spaces. Yeung et al. [
19] studied the lattice and topological structures of fuzzy rough sets. Chen et al. discussed the granular structure of fuzzy rough sets and developed a theory of granular computing based on fuzzy relations in [
20]. They proposed the concept of granular fuzzy sets and investigated the properties of these sets using constructive and axiomatic approaches. The granular fuzzy sets were used to describe the lower and upper approximations of a fuzzy set within the framework of granular computing, and the structure of attribute reduction in terms of granular fuzzy sets was characterized.
Type-2 fuzzy rough set is a combination of rough sets and type-2 fuzzy sets. As an extension of fuzzy sets, type-2 fuzzy sets [
21] are useful in circumstances where it is difficult to determine the exact membership functions of a fuzzy set because the membership degrees are fuzzy themselves. Type-2 fuzzy rough sets may solve problems with higher complexity, and there have been several literature works in this field [
22,
23,
24]. In some practical applications, we often encounter situations involving more than one universe. For example, in medical diagnosis, a certain disease may simultaneously have several symptoms, whereas one symptom may be shared by different diseases. Zhang et al. [
25] proposed a general study of interval-valued fuzzy rough sets on two universes of discourse. Sun et al. [
26] defined the fuzzy compatible relation and presented the fuzzy rough set model on the different universes. Liu et al. proposed the graded rough set model on two distinct, but related universes in [
27]. Ma et al. [
28] presented the properties of the probabilistic rough set over two universes and discussed the uncertainty measure of the knowledge granularity and rough entropy for a probabilistic rough set over two universes. Sun et al. [
29] considered a problem of emergency material demand prediction based on a fuzzy rough set model over two universes. Yang et al. proposed a fuzzy probabilistic rough set model on two universes and presented concepts of the inverse lower and upper approximation operators in [
30]. However, type-2 fuzzy rough sets over two universes have not been discussed.
As generalizations of rough sets, type-2 fuzzy rough sets over one or two universes can be incorporated into the scope of granular computing if we can reveal their granular structures, and the granular structures will be beneficial to their application. In [
24], we generalized the concepts of granular fuzzy sets in [
20] to the frame of type-2 fuzzy sets and presented a definition of granular type-2 fuzzy sets without proof of its reasonability. Then, we discussed the granular structure of type-2 fuzzy rough sets over one universe based on these two granular type-2 fuzzy sets.
In this paper, the granular structure discussed in [
24] will be generalized to the type-2 fuzzy rough sets over different universes based on novel granular type-2 fuzzy sets, which are deduced from the definition of type-2 fuzzy rough sets, and consequently, more reasonable than those given in [
24]. The rest of this paper is organized as follows. Fundamental concepts and properties that will be used in this paper are reviewed in
Section 2.
Section 3 introduces the definition of a type-2 fuzzy rough set over two universes. In
Section 4, the granular structure of type-2 fuzzy rough sets over two universes is discussed using granular type-2 fuzzy sets. Some illustrative examples are given in
Section 5, and conclusions are presented in
Section 6.
3. Type-2 Fuzzy Rough Sets over Two Universes
Since type-2 fuzzy sets can be used to describe more uncertainties than type-1 fuzzy sets because the membership functions of type-2 fuzzy sets are themselves fuzzy, type-2 fuzzy rough sets can be used to solve problems with more uncertainties. In this section, we will extend the definition of type-2 fuzzy rough set proposed in [
24], which was defined on one universe, to the circumstance of two different universes.
Definition 1. Let X and Y be two nonempty finite universes and be a type-2 fuzzy relation from X to Y. The triple set is called a type-2 fuzzy approximation space over two different universes. For any type-2 fuzzy set , the lower approximation and the upper approximation of with respect to are two type-2 fuzzy sets in X, respectively. If and can be represented as by the representation theorem, we have:where and are the embedded type-2 set and embedded type-1 set of , respectively, and is the simplified notation of , whereas and are the embedded type-2 and embedded type-1 set of , respectively, and is the simplified notation of . Consequently, and can be calculated by:and The ordered pair is called a type-2 fuzzy rough set over two universes.
Note: If
and
degenerate to be interval type-2 fuzzy sets,
and:
If
and
degenerate to be type-1 fuzzy sets, then:
which are in accordance with the definition of (type-1) fuzzy rough set over two universes given in [
29].
Example 1. Let , . Suppose is a type-2 fuzzy relation from X to Y, which can be defined as follows: Then, , where and are embedded type-2 sets of : Considering a type-2 fuzzy set in Y (Figure 1a):we have , where:andare embedded type-2 sets of the lower approximation and the upper approximation of with respect to (Figure 1b) can be calculated as follows: Next, we will discuss the properties of the lower and upper approximation operators.
Lemma 1. Let X and Y be two nonempty finite universes and be a type-2 fuzzy relation from X to Y. For any , if are embedded type-2 sets of and respectively, the following properties hold:
- 1.
;
- 2.
;
- 3.
;
- 4.
.
Theorem 1. Let X and Y be two nonempty finite universes and be a type-2 fuzzy relation from X to Y. For any , the following properties hold:
- 1.
;
- 2.
;
- 3.
;
- 4.
.
Proof. - 1.
- 2.
- 3.
- 4.
☐
4. Granular Structure of Type-2 Fuzzy Rough Sets over Two Universes
The granular structures of classical rough sets and ordinary fuzzy rough sets are clear, and the lower and upper approximation sets can be represented by some basic granules. Here, we will discuss the basic granules in type-2 fuzzy rough sets over two universes, which can be used to calculate the lower and upper approximation sets of a type-2 fuzzy set.
In classical rough set theory, for a nonempty and finite universe
X and an equivalent relation
, the upper and lower approximation sets of
can be defined as follows:
Take
and
in the above two equations respectively, and we have:
Next, we will try to find the “equivalence classes” of a type-2 fuzzy point and its complement, both of which should be type-2 fuzzy sets.
Let
Y be a nonempty universes. A type-2 fuzzy point in
Y is a special type-2 fuzzy set defined as follows: for any
,
where
and
. The complement of
, denoted by
, is also a type-2 fuzzy set on
Y: for any
,
Definition 2. Let X and Y be two nonempty finite universes. Suppose is a type-2 fuzzy relation from X to Y, is an embedded type-2 set of and is the corresponding embedded type-1 set. For a type-2 fuzzy point , two granular type-2 fuzzy sets and are defined as: for any and Let ,
From the above definition, it is clear that and .
Example 2. Consider the type-2 fuzzy relation given in the previous example. Take a type-2 fuzzy point bywe haveso: and are depicted in Figure 2. Obviously, is exactly the complement of . Theorem 2. Let X and Y be two nonempty finite universes and be a type-2 fuzzy relation from X to Y. If is an embedded type-2 set of and is the corresponding embedded type-1 set, for we have:
- 1.
- 2.
- 3.
- 4.
Theorem 3. Let X and Y be two nonempty finite universes. Suppose and are type-2 fuzzy relations from X to Y and and are embedded type-2 sets of and , respectively, then for
- 1.
- 2.
- 3.
- 4.
Lemma 2. Let X and Y be two nonempty finite universes. Suppose is a type-2 fuzzy relation from X to Y, is an embedded type-2 set of and is the corresponding embedded type-1 set. For
- 1.
If
- 2.
If
Theorem 4. Let be a discrete type-2 fuzzy relation from X to Y, where X and Y are nonempty finite universes. For a discrete type-2 fuzzy set , if and are embedded type-2 sets of and respectively, we have:and: We have mentioned in
Section 2.2 that basic granules in the theory of the classic rough set are equivalence classes, and the lower and upper approximations of a crisp set can be computed by the basic granules or the complements of the basic granules. Similarly, in the theory of fuzzy rough set, Chen et al. [
20] proved that
and
, which are called basic granules of fuzzy rough sets, corresponded to the equivalence classes and the complements of equivalence classes, respectively, and the upper and lower approximations of a fuzzy set can be expressed as the union or intersection of basic granules. Taking
and
as basic granule sets, the above theorem reveals that these basic granules can be used to compute the upper and lower approximations of a type-2 fuzzy set by the operators of union and intersection. Therefore,
and
correspond to the equivalence classes and the complements of equivalence classes, respectively.
Example 3. Similar to the previous example, we can calculate granular type-2 fuzzy sets of for any : 5. Examples
Example 4. Suppose is a set of four different houses, all of which can be described by an attribute set where stands for , stands for , stands for , stands for and stands for .
The correlation degree between X and Y (i.e., ) is given in Table 1. Suppose is a client who wants to purchase a house among the four alternative offers, and the demand of can be described by a type-2 fuzzy set (Figure 3a): By the definitions of the lower and upper type-2 fuzzy rough approximation operators, we can calculate the lower and upper type-2 fuzzy rough approximations of .
Since and , where:we have:and: Let:where is the centroid of . If , then is the best choice of
If , then consider : if , we have that is the best choice of if , we take as the best choice of [29]. Since , , , is the best house for .
From the definition of , it is clear that client pays most attention to and , the surrounding facilities and the structure, and , price, is the least important factor. is the best house both in surrounding facilities and structure.
Consider another client for house purchasing (Figure 4a): Using the definition of granular type-2 fuzzy sets, we can compute the upper and lower approximations of :where:and: