Next Article in Journal
Optimized Charging Scheduling with Single Mobile Charger for Wireless Rechargeable Sensor Networks
Next Article in Special Issue
Continuity of Fuzzified Functions Using the Generalized Extension Principle
Previous Article in Journal
Fishmeal Supplier Evaluation and Selection for Aquaculture Enterprise Sustainability with a Fuzzy MCDM Approach
Previous Article in Special Issue
A Hybrid Fuzzy DEA/AHP Methodology for Ranking Units in a Fuzzy Environment
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Granular Structure of Type-2 Fuzzy Rough Sets over Two Universes

1
School of Computer and Information Technology, Shanxi University, Taiyuan 030006, Shanxi, China
2
School of Science, North University of China, Taiyuan 030051, Shanxi, China
*
Author to whom correspondence should be addressed.
Symmetry 2017, 9(11), 284; https://doi.org/10.3390/sym9110284
Submission received: 24 October 2017 / Revised: 14 November 2017 / Accepted: 15 November 2017 / Published: 21 November 2017
(This article belongs to the Special Issue Fuzzy Sets Theory and Its Applications)

Abstract

:
Granular structure plays a very important role in the model construction, theoretical analysis and algorithm design of a granular computing method. The granular structures of classical rough sets and fuzzy rough sets have been proven to be clear. In classical rough set theory, equivalence classes are basic granules, and the lower and upper approximations of a set can be computed by those basic granules. In the theory of fuzzy rough set, granular fuzzy sets can be used to describe the lower and upper approximations of a fuzzy set. This paper discusses the granular structure of type-2 fuzzy rough sets over two universes. Definitions of type-2 fuzzy rough sets over two universes are given based on a wavy-slice representation of type-2 fuzzy sets. Two granular type-2 fuzzy sets are deduced and then proven to be basic granules of type-2 fuzzy rough sets over two universes. Then, the properties of lower and upper approximation operators and these two granular type-2 fuzzy sets are investigated. At last, several examples are given to show the applications of type-2 fuzzy rough sets over two universes.

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.

2. Preliminaries

2.1. Type-2 Fuzzy Sets

To facilitate the discussion, we introduce the basic definitions and properties of type-2 fuzzy sets in this section with reference to [31,32].
For a nonempty universe X, a type-2 fuzzy set A ˜ on X can be characterized by a type-2 membership function μ A ˜ ( x , u ) , i.e.,
A ˜ = { ( ( x , u ) , μ A ˜ ( x , u ) ) | x X , u J x [ 0 , 1 ] } ,
or
A ˜ = x X u J x μ A ˜ ( x , u ) / ( x , u ) , J x [ 0 , 1 ] ,
where 0 μ A ˜ ( x , u ) 1 and denotes union over all admissible x and u. F ˜ ( X ) denotes the class of all type-2 fuzzy sets on the universe X.
For a given x , μ A ˜ ( x , u ) is a fuzzy set on J x , which is called a vertical slice of μ A ˜ ( x , u ) or a secondary membership function, and it can be denoted by μ A ˜ ( x ) or f x . J x is called the primary membership of x . The amplitude of a secondary membership function is called a secondary grade. A vertical-slice representation of a type-2 fuzzy set is:
A ˜ = x X μ A ˜ ( x ) / x = x X [ u J x f x ( u ) / u ] / x .
Mendel and John [32] presented a wavy-slice representation for discrete type-2 fuzzy sets (both X and J x are assumed to be discrete) in 2002. Suppose that X is discretized into N values, x 1 , , x N , and that at each of these values, J x i is discretized into M i values, i.e.,
A ˜ = [ k = 1 M 1 f x 1 ( u 1 ( k ) ) / u 1 ( k ) ] / x 1 + + [ k = 1 M N f x N ( u N ( k ) ) / u N ( k ) ] / x N .
For a discrete type-2 fuzzy set A ˜ , take exactly one element from J x 1 , J x 2 , , J x N , namely u 1 j , u 2 j , , u N j , each with its associated secondary grade, namely f x 1 ( u 1 j ) , f x 2 ( u 2 j ) , , f x N ( u N j ) , then we get a wavy-slice of A ˜ , i.e.,
A ˜ j = i = 1 N [ f x i ( u i j ) / u i j ] / x i , u i j J x i [ 0 , 1 ] ,
which is called an embedded type-2 set. An embedded type-1 set A j is the union of all the primary memberships of set A ˜ j , i.e.,
A j = i = 1 N u i j / x i , u i j J x i [ 0 , 1 ] .
The total of A ˜ j is i = 1 N M i and so is that of A j .
The Representation Theorem [32] (the wavy-slice representation of a type-2 fuzzy set) proposed by Mendel and John indicates that a discrete type-2 fuzzy set A ˜ can be represented as the union of its embedded type-2 sets, i.e.,
A ˜ = j = 1 n A ˜ j
where n = i = 1 N M i .
Consider two discrete type-2 fuzzy sets A ˜ and B ˜ , which are expressed by their embedded type-2 sets:
A ˜ = j = 1 n A A ˜ j = j = 1 n A i = 1 N f x i ( u i j ) / u i j x i
and:
B ˜ = k = 1 n B B ˜ k = k = 1 n B i = 1 N g x i ( w i k ) / w i k x i ,
the operations of union, intersection and complement are defined as follows:
A ˜ B ˜ =    j = 1 n A k = 1 n B { [ f x 1 ( u 1 j ) g x 1 ( w 1 k ) / u 1 j w 1 k ] / x 1 + +    [ f x N ( u N j ) g x N ( w N k ) / u N j w N k ] / x N } , A ˜ B ˜ =    j = 1 n A k = 1 n B { [ f x 1 ( u 1 j ) g x 1 ( w 1 k ) / u 1 j w 1 k ] / x 1 + +    [ f x N ( u N j ) g x N ( w N k ) / u N j w N k ] / x N } ,
( A ˜ ) c = j = 1 n A ( i = 1 N [ f x i ( u i j ) / ( 1 u i j ) ] / x i ) = i = 1 N ( j = 1 M i [ f x i ( u i j ) / ( 1 u i j ) ] ) / x i .
The expressions for μ A ˜ B ˜ ( x i ) , μ A ˜ B ˜ ( x i ) and μ ( A ˜ ) c ( x i ) can be obtained as:
μ A ˜ B ˜ ( x i ) = j = 1 n A k = 1 n B f x i ( u i j ) g x i ( w i k ) / u i j w i k μ A ˜ ( x i ) μ B ˜ ( x i ) ,
μ A ˜ B ˜ ( x i ) = j = 1 n A k = 1 n B f x i ( u i j ) g x i ( w i k ) / u i j w i k μ A ˜ ( x i ) μ B ˜ ( x i ) ,
μ ( A ˜ ) c ( x i ) = j = 1 M i f x i ( u i j ) / ( 1 u i j ) ¬ μ A ˜ ( x i ) ,
where μ A ˜ ( x i ) μ B ˜ ( x i ) and μ A ˜ ( x i ) μ B ˜ ( x i ) indicate the join and meet of the secondary membership functions μ A ˜ ( x ) and μ B ˜ ( x i ) , and ¬ μ A ˜ ( x i ) indicates the negation of the secondary membership function μ A ˜ ( x i ) .
Considering two discrete type-2 fuzzy sets A ˜ and B ˜ , which have unique embedded type-2 sets, i.e.,
A ˜ = i = 1 N f x i ( u i ) / u i x i and B ˜ = i = 1 N g x i ( w i ) / w i x i ,
then A ˜ B ˜ is defined as u i w i and f x i ( u i ) g x i ( w i ) ( i = 1 , , N ) .
For a family of discrete type-2 fuzzy sets with unique embedded type-2 sets:
A ˜ ( γ ) = i = 1 N f x i ( γ ) ( u i ( γ ) ) / u i ( γ ) x i , γ Γ ,
where Γ is a finite index set, the union of these type-2 fuzzy sets is:
γ Γ A ˜ ( γ ) = i = 1 N γ Γ f x i ( γ ) ( u i ( γ ) ) / γ Γ u i ( γ ) x i ,
and the intersection of these type-2 fuzzy sets is:
γ Γ A ˜ ( γ ) = i = 1 N γ Γ f x i ( γ ) ( u i ( γ ) ) / γ Γ u i ( γ ) x i .
Obviously, γ Γ A ˜ ( γ ) γ Γ B ˜ ( γ ) and γ Γ A ˜ ( γ ) γ Γ B ˜ ( γ ) if A ˜ ( γ ) B ˜ ( γ ) ( γ Γ ) .
Let X and Y be two nonempty universes. A type-2 fuzzy relation from X to Y is a type-2 fuzzy set R ˜ F ˜ ( X × Y ) . If X = Y , then R ˜ is called a type-2 fuzzy relation on X.
A discrete type-2 fuzzy relation R ˜ can be represented as the union of its embedded type-2 sets:
R ˜ = l = 1 n R R ˜ e l ,
where n R i = 1 n j = 1 m M i j ( M i j = | J ( x i , y j ) | ), and R ˜ e l is the l-th embedded type-2 set of R ˜ .

2.2. Fuzzy Rough Sets

In 1982, Pawlak proposed the theory of rough set as a new mathematical tool for reasoning about data. For a finite and nonempty universe X, if R X × X is an equivalence relation on X, i.e., R is reflexive, symmetric and transitive, the pair ( X , R ) is called an approximation space. For any x X , [ x ] R = { y X : ( x , y ) R } is called the equivalence class containing x. The family of all equivalence classes defines a partition of the universe X. Two elements x and y are said to be indiscernible if they belong to the same equivalence class. Given an arbitrary set A X , it may be characterized by a pair of lower and upper approximations defined as:
R ̲ A = { [ x ] R : [ x ] R A } = { x X : [ x ] R A } ,
R ¯ A = { [ x ] R : [ x ] R A } = { x X : [ x ] R A } = { [ x ] R : x A } .
or:
R ̲ A = { ( [ x ] R ) c : x A c } , R ¯ A = { ( [ x ] R ) c : A ( [ x ] R ) c } .
That is to say, equivalence classes can be used as basic granules to approximate a set.
Let X be a nonempty universe and R be a fuzzy binary relation on X. The fuzzy rough set of a fuzzy set A is a pair ( R ̲ ( A ) , R ¯ ( A ) ) such that for every x X :
R ¯ ( A ) ( x ) sup y X min { R ( x , y ) , μ A ( y ) } ,
R ̲ ( A ) ( x ) inf y X max { 1 R ( x , y ) , μ A ( y ) } .
Chen et al. [20] discovered the granular structure of fuzzy rough sets and pointed out that fuzzy sets [ x λ ] R T and [ x λ ] R S were basic granules corresponding to the equivalence classes, which were defined as:
[ x λ ] R T ( y ) = T ( R ( x , y ) , λ ) , [ x λ ] R S ( y ) = S ( N ( R ( x , y ) ) , N ( λ ) ) ,
where x λ is a fuzzy point, T is a triangular norm, S is a triangular conorm, N is a negator and T and S are dual with respect to N. For a T-fuzzy similarity relation R, the lower and upper approximations of a fuzzy set A can be expressed as the union or intersection of some basic fuzzy information granules:
R ϑ ̲ A = { [ x λ ] R T : [ x λ ] R T A } , R T ¯ A = { [ x A ( x ) ] R T : x X } ;
R S ̲ A = { [ x N ( A ( x ) ) ] R S : x X } , R σ ¯ A = { [ x λ ] R S : A [ x λ ] R S } .

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 R ˜ F ˜ ( X × Y ) be a type-2 fuzzy relation from X to Y. The triple set ( X , Y , R ˜ ) is called a type-2 fuzzy approximation space over two different universes. For any type-2 fuzzy set B ˜ F ˜ ( Y ) , the lower approximation R ˜ ̲ ( B ˜ ) and the upper approximation R ˜ ¯ ( B ˜ ) of B ˜ with respect to ( X , Y , R ˜ ) are two type-2 fuzzy sets in X, respectively. If R ˜ and B ˜ can be represented as R ˜ = γ = 1 n R R ˜ γ   a n d   B ˜ = β = 1 n B B ˜ β by the representation theorem, we have:
R ˜ γ ̲ ( B ˜ β ) ( x ) = y Y [ R γ * ( x , y ) B β * ( y ) ] y Y [ ( 1 R γ ( x , y ) ) B β ( y ) ] , x X ,
R ˜ γ ¯ ( B ˜ β ) ( x ) = y Y [ R γ * ( x , y ) B β * ( y ) ] y Y [ R γ ( x , y ) B β ( y ) ] , x X ,
where R ˜ γ and R γ are the embedded type-2 set and embedded type-1 set of R ˜ , respectively, and R γ * ( x , y ) is the simplified notation of R ˜ γ ( ( x , y ) , R γ ( x , y ) ) , whereas B ˜ β and B β are the embedded type-2 and embedded type-1 set of B ˜ , respectively, and B β * ( y ) is the simplified notation of B ˜ β ( y , B β ( y ) ) .
Consequently, R ˜ ̲ ( B ˜ ) and R ˜ ¯ ( B ˜ ) can be calculated by:
R ˜ ̲ ( B ˜ ) = γ = 1 n R β = 1 n B R ˜ γ ̲ ( B ˜ β )
and
R ˜ ¯ ( B ˜ ) = γ = 1 n R β = 1 n B R ˜ γ ¯ ( B ˜ β ) .
The ordered pair ( R ˜ ̲ ( B ˜ ) , R ˜ ¯ ( B ˜ ) ) is called a type-2 fuzzy rough set over two universes.
Note: If R ˜ and B ˜ degenerate to be interval type-2 fuzzy sets,
R ˜ γ ̲ ( B ˜ β ) ( x ) = y Y [ ( 1 R γ ( x , y ) B β ( y ) ) ] ,
R ˜ γ ¯ ( B ˜ β ) ( x ) = y Y [ R γ ( x , y ) B β ( y ) ] ,
and:
R ˜ ̲ ( B ˜ ) = γ = 1 n R β = 1 n B { y Y [ ( 1 R γ ( x , y ) B β ( y ) ) ] }
R ˜ ¯ ( B ˜ ) = γ = 1 n R β = 1 n B { y Y [ R γ ( x , y ) B β ( y ) ] } .
If R ˜ and B ˜ degenerate to be type-1 fuzzy sets, then:
R ˜ ̲ ( B ˜ ) ( x ) = y Y [ ( 1 R ( x , y ) ) B ( y ) ] ,
R ˜ ¯ ( B ˜ ) ( x ) = y Y [ R ( x , y ) B ( y ) ] ,
which are in accordance with the definition of (type-1) fuzzy rough set over two universes given in [29].
Example 1.
Let X = { x 1 , , x 6 } , Y = { y 1 , , y 6 } . Suppose R ˜ is a type-2 fuzzy relation from X to Y, which can be defined as follows:
R ˜ ( x i , y j ) = 1 / 0.4 1 / 0.6 1 / 0.4 0.5 / 0.7 + 1 / 0.6 1 / 0.3 1 / 0.2 1 / 0.7 1 / 0.3 1 / 0.2 1 / 0.5 1 / 0.8 1 / 0.6 1 / 0.5 1 / 0.2 1 / 0.6 1 / 0.3 1 / 0.7 1 / 0.1 1 / 0.4 1 / 0.6 1 / 0.5 1 / 0.7 1 / 0.5 1 / 0.3 1 / 0.3 1 / 0.5 1 / 0.7 1 / 0.3 1 / 0.6 1 / 0.8 1 / 0.1 1 / 0.7 1 / 0.8 1 / 0.6 1 / 0.3 1 / 0.2 .
Then, R ˜ = γ = 1 2 R ˜ γ , where R ˜ 1 and R ˜ 2 are embedded type-2 sets of R ˜ :
R ˜ 1 ( x i , y j ) = 1 / 0.4 1 / 0.6 1 / 0.4 0.5 / 0.7 1 / 0.3 1 / 0.2 1 / 0.7 1 / 0.3 1 / 0.2 1 / 0.5 1 / 0.8 1 / 0.6 1 / 0.5 1 / 0.2 1 / 0.6 1 / 0.3 1 / 0.7 1 / 0.1 1 / 0.4 1 / 0.6 1 / 0.5 1 / 0.7 1 / 0.5 1 / 0.3 1 / 0.3 1 / 0.5 1 / 0.7 1 / 0.3 1 / 0.6 1 / 0.8 1 / 0.1 1 / 0.7 1 / 0.8 1 / 0.6 1 / 0.3 1 / 0.2 ,
R ˜ 2 ( x i , y j ) = 1 / 0.4 1 / 0.6 1 / 0.4 1 / 0.6 1 / 0.3 1 / 0.2 1 / 0.7 1 / 0.3 1 / 0.2 1 / 0.5 1 / 0.8 1 / 0.6 1 / 0.5 1 / 0.2 1 / 0.6 1 / 0.3 1 / 0.7 1 / 0.1 1 / 0.4 1 / 0.6 1 / 0.5 1 / 0.7 1 / 0.5 1 / 0.3 1 / 0.3 1 / 0.5 1 / 0.7 1 / 0.3 1 / 0.6 1 / 0.8 1 / 0.1 1 / 0.7 1 / 0.8 1 / 0.6 1 / 0.3 1 / 0.2 .
Considering a type-2 fuzzy set in Y (Figure 1a):
B ˜ = 1 / 1 y 1 + 1 / 0 + 0.5 / 0.2 y 2 + 1 / 1 y 3 + 1 / 0.7 y 4 + 1 / 1 y 5 + 1 / 0.5 y 6 ,
we have B ˜ = β = 1 2 B ˜ β , where:
B ˜ 1 = 1 / 1 y 1 + 1 / 0 y 2 + 1 / 1 y 3 + 1 / 0.7 y 4 + 1 / 1 y 5 + 1 / 0.5 y 6
and
B ˜ 2 = 1 / 1 y 1 + 0.5 / 0.2 y 2 + 1 / 1 y 3 + 1 / 0.7 y 4 + 1 / 1 y 5 + 1 / 0.5 y 6
are embedded type-2 sets of B ˜ , the lower approximation R ˜ ̲ ( B ˜ ) and the upper approximation R ˜ ¯ ( B ˜ ) of B ˜ with respect to ( X , Y , R ˜ ) (Figure 1b) can be calculated as follows:
R ˜ 1 ̲ ( B ˜ 1 ) = 0.5 / 0.4 x 1 + 1 / 0.5 x 2 + 1 / 0.7 x 3 + 1 / 0.4 x 4 + 1 / 0.5 x 5 + 1 / 0.3 x 6 ,
R ˜ 1 ̲ ( B ˜ 2 ) = 0.5 / 0.4 x 1 + 0.5 / 0.5 x 2 + 0.5 / 0.7 x 3 + 0.5 / 0.4 x 4 + 0.5 / 0.5 x 5 + 0.5 / 0.3 x 6 ,
R ˜ 2 ̲ ( B ˜ 1 ) = 1 / 0.4 x 1 + 1 / 0.5 x 2 + 1 / 0.7 x 3 + 1 / 0.4 x 4 + 1 / 0.5 x 5 + 1 / 0.3 x 6 ,
R ˜ 2 ̲ ( B ˜ 2 ) = 0.5 / 0.4 x 1 + 1 / 0.5 x 2 + 1 / 0.7 x 3 + 1 / 0.4 x 4 + 1 / 0.5 x 5 + 1 / 0.3 x 6 ,
R ˜ ̲ ( B ˜ ) = γ = 1 2 β = 1 2 R ˜ γ ̲ ( B ˜ β ) = 1 / 0.4 x 1 + 1 / 0.5 x 2 + 1 / 0.7 x 3 + 1 / 0.4 x 4 + 1 / 0.5 x 5 + 1 / 0.3 x 6 ;
R ˜ 1 ¯ ( B ˜ 1 ) = 0.5 / 0.7 x 1 + 1 / 0.8 x 2 + 1 / 0.7 x 3 + 1 / 0.7 x 4 + 1 / 0.7 x 5 + 1 / 0.8 x 6 ,
R ˜ 1 ¯ ( B ˜ 2 ) = 0.5 / 0.7 x 1 + 0.5 / 0.8 x 2 + 0.5 / 0.7 x 3 + 0.5 / 0.7 x 4 + 0.5 / 0.7 x 5 + 0.5 / 0.8 x 6 ,
R ˜ 2 ¯ ( B ˜ 1 ) = 1 / 0.6 x 1 + 1 / 0.8 x 2 + 1 / 0.7 x 3 + 1 / 0.7 x 4 + 1 / 0.7 x 5 + 1 / 0.8 x 6 ,
R ˜ 2 ¯ ( B ˜ 2 ) = 0.5 / 0.6 x 1 + 0.5 / 0.8 x 2 + 0.5 / 0.7 x 3 + 0.5 / 0.7 x 4 + 0.5 / 0.7 x 5 + 0.5 / 0.8 x 6 ,
R ˜ ¯ ( B ˜ ) = γ = 1 2 β = 1 2 R ˜ γ ¯ ( B ˜ β ) = 0.5 / 0.7 + 1 / 0.6 x 1 + 1 / 0.8 x 2 + 1 / 0.7 x 3 + 1 / 0.7 x 4 + 1 / 0.7 x 5 + 1 / 0.8 x 6 .
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 R ˜ be a type-2 fuzzy relation from X to Y. For any A ˜ , B ˜ F ˜ ( Y ) , if R ˜ γ , A ˜ α , B ˜ β are embedded type-2 sets of R ˜ , A ˜ and B ˜ respectively, the following properties hold:
1. 
R ˜ γ ̲ ( B ˜ β c ) = ( R ˜ γ ¯ ( B ˜ β ) ) c ;
2. 
R ˜ γ ¯ ( B ˜ β c ) = ( R ˜ γ ̲ ( B ˜ β ) ) c ;
3. 
R ˜ γ ¯ ( A ˜ α B ˜ β ) = R ˜ γ ¯ ( A ˜ α ) R ˜ γ ¯ ( B ˜ β ) ;
4. 
R ˜ γ ̲ ( A ˜ α B ˜ β ) = R ˜ γ ̲ ( A ˜ α ) R ˜ γ ̲ ( B ˜ β ) .
Proof. 
  • For any x X ,
    [ R ˜ γ ¯ ( B ˜ β ) ] c ( x ) = ¬ ( y Y [ R γ * ( x , y ) B β * ( y ) ] y Y [ R γ ( x , y ) B β ( y ) ] ) = y Y [ R γ * ( x , y ) B β * ( y ) ] y Y [ ( 1 R γ ( x , y ) ) B β c ( y ) ] = R ˜ γ ̲ ( B ˜ β c ) ( x ) .
  • For any x X ,
    [ R ˜ γ ̲ ( B ˜ β ) ] c ( x ) = ¬ ( y Y [ R γ * ( x , y ) B β * ( y ) ] y Y [ ( 1 R γ ( x , y ) ) B β ( y ) ] ) = y Y [ R γ * ( x , y ) B β * ( y ) ] y Y [ R γ ( x , y ) B β c ( y ) ] = R ˜ γ ¯ ( B ˜ β c ) ( x ) .
  • For any x X ,
    R ˜ γ ¯ ( A ˜ α B ˜ β ) ( x ) = y Y [ R γ * ( x , y ) A α * ( y ) B β * ( y ) ] y Y [ R γ ( x , y ) ( A α ( y ) B β ( y ) ) ] = y Y [ R γ * ( x , y ) A α * ( y ) ] { y Y [ R γ * ( x , y ) B β * ( y ) ] } y Y [ R γ ( x , y ) A α ( y ) ] { y Y [ R γ ( x , y ) B β ( y ) ] } = y Y [ R γ * ( x , y ) A α * ( y ) ] y Y [ R γ ( x , y ) A α ( y ) ] y Y [ R γ * ( x , y ) B β * ( y ) ] y Y [ R γ ( x , y ) B β ( y ) ] = R ˜ γ ¯ ( A ˜ α ) ( x ) R ˜ γ ¯ ( B ˜ β ) ( x ) .
  • For any x X ,
    R ˜ γ ̲ ( A ˜ α B ˜ β ) ( x ) = y Y [ R γ * ( x , y ) A α * ( y ) B β * ( y ) ] y Y [ ( 1 R γ ( x , y ) ) ( ( A α ( y ) B β ( y ) ) ] = y Y [ R γ * ( x , y ) A α * ( y ) ] { y Y [ R γ * ( x , y ) B β * ( y ) ] } y Y [ ( 1 R γ ( x , y ) ) A α ( y ) ] { y Y [ ( 1 R γ ( x , y ) ) B β ( y ) ] } = y Y [ R γ * ( x , y ) A α * ( y ) ] y Y [ ( 1 R γ ( x , y ) ) A α ( y ) ] y Y [ R γ * ( x , y ) B β * ( y ) ] y Y [ ( 1 R γ ( x , y ) ) B β ( y ) ] = R ˜ γ ̲ ( A ˜ α ) ( x ) R ˜ γ ̲ ( B ˜ β ) ( x ) .
 ☐
Theorem 1.
Let X and Y be two nonempty finite universes and R ˜ be a type-2 fuzzy relation from X to Y. For any A ˜ , B ˜ F ˜ ( Y ) , the following properties hold:
1. 
R ˜ ̲ ( B ˜ c ) = ( R ˜ ¯ ( B ˜ ) ) c ;
2. 
R ˜ ¯ ( B ˜ c ) = ( R ˜ ̲ ( B ˜ ) ) c ;
3. 
R ˜ ¯ ( A ˜ B ˜ ) = R ˜ ¯ ( A ˜ ) R ˜ ¯ ( B ˜ ) ;
4. 
R ˜ ̲ ( A ˜ B ˜ ) = R ˜ ̲ ( A ˜ ) R ˜ ̲ ( B ˜ ) .
Proof. 
1.
R ˜ ̲ ( B ˜ c ) = γ = 1 n R β = 1 n B R ˜ γ ̲ ( B ˜ β c ) = γ = 1 n R β = 1 n B ( R ˜ γ ¯ ( B ˜ β ) ) c = ( R ˜ ¯ ( B ˜ ) ) c .
2.
R ˜ ¯ ( B ˜ c ) = γ = 1 n R β = 1 n B R ˜ γ ¯ ( B ˜ β c ) = γ = 1 n R β = 1 n B ( R ˜ γ ̲ ( B ˜ β ) ) c = ( R ˜ ̲ ( B ˜ ) ) c .
3.
R ˜ ¯ ( A ˜ B ˜ ) = γ = 1 n R α = 1 n A β = 1 n B R ˜ γ ¯ ( A ˜ α B ˜ β ) = γ = 1 n R α = 1 n A β = 1 n B [ R ˜ γ ¯ ( A ˜ α ) R ˜ γ ¯ ( B ˜ β ) ] = γ = 1 n R α = 1 n A R ˜ γ ¯ ( A ˜ α ) γ = 1 n R β = 1 n B R ˜ γ ¯ ( B ˜ β ) = R ˜ ¯ ( A ˜ ) R ˜ ¯ ( B ˜ ) .
4.
R ˜ ̲ ( A ˜ B ˜ ) = γ = 1 n R α = 1 n A β = 1 n B R ˜ γ ̲ ( A ˜ α B ˜ β ) = γ = 1 n R α = 1 n A β = 1 n B [ R ˜ γ ̲ ( A ˜ α ) R ˜ γ ̲ ( B ˜ β ) ] = γ = 1 n R α = 1 n A R ˜ γ ̲ ( A ˜ α ) γ = 1 n R β = 1 n B R ˜ γ ̲ ( B ˜ β ) = R ˜ ̲ ( A ˜ ) R ˜ ̲ ( B ˜ ) .
 ☐

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 R X × X , the upper and lower approximation sets of A X can be defined as follows:
R ¯ A = { [ x ] R : x A } ,
R ̲ A = { ( [ x ] R ) c : x A c } .
Take A = { y } and A = X { y } = { y } c in the above two equations respectively, and we have:
R ¯ ( { y } ) = { [ x ] R : x { y } } = [ y ] R ,
R ̲ ( { y } c ) = { ( [ x ] R ) c : x { y } } = ( [ y ] R ) c .
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 z Y ,
y λ μ ( z ) = μ / λ , if z = y 1 / 0 , if z y ,
where λ [ 0 , 1 ] and μ ( 0 , 1 ] . The complement of y λ μ , denoted by y λ μ ¯ , is also a type-2 fuzzy set on Y: for any y Y ,
y λ μ ¯ ( z ) = μ / 1 λ , if z = y 1 / 1 , if z y .
Definition 2.
Let X and Y be two nonempty finite universes. Suppose R ˜ is a type-2 fuzzy relation from X to Y, R ˜ γ is an embedded type-2 set of R ˜ and R γ is the corresponding embedded type-1 set. For a type-2 fuzzy point y λ μ F ˜ ( Y ) , two granular type-2 fuzzy sets [ y λ μ ] R ˜ γ and [ y λ μ ] R ˜ γ are defined as: for any x X ,
[ y λ μ ] R ˜ γ ( x ) = R ˜ γ ¯ ( y λ μ ) ( x ) = z Y R γ * ( x , z ) μ R γ ( x , y ) λ
and
[ y λ μ ] R ˜ γ ( x ) = R ˜ γ ̲ ( y λ μ ¯ ) ( x ) = z Y R γ * ( x , z ) μ [ 1 R γ ( x , y ) ] ( 1 λ ) .
Let M R ˜ γ = { [ y λ μ ] R ˜ γ : y Y , λ [ 0 , 1 ] , μ ( 0 , 1 ] } , M R ˜ γ = { [ y λ μ ] R ˜ γ : y Y , λ [ 0 , 1 ] , μ ( 0 , 1 ] } .
From the above definition, it is clear that ( [ y λ μ ] R ˜ γ ) c = [ y λ μ ] R ˜ γ and ( [ y λ μ ] R ˜ γ ) c = [ y λ μ ] R ˜ γ .
Example 2.
Consider the type-2 fuzzy relation R ˜ given in the previous example. Take a type-2 fuzzy point ( y 4 ) 0.7 1 , by
[ ( y 4 ) 0.7 1 ] R ˜ γ ( x i ) = z Y R γ * ( x i , z ) 1 R γ ( x i , y 4 ) 0.7 , i = 1 , , 6 ; γ = 1 , 2 ,
we have
[ ( y 4 ) 0.7 1 ] R ˜ 1 = 0.5 / 0.7 x 1 + 1 / 0.5 x 2 + 1 / 0.3 x 3 + 1 / 0.7 x 4 + 1 / 0.3 x 5 + 1 / 0.6 x 6 ,
[ ( y 4 ) 0.7 1 ] R ˜ 2 = 1 / 0.6 x 1 + 1 / 0.5 x 2 + 1 / 0.3 x 3 + 1 / 0.7 x 4 + 1 / 0.3 x 5 + 1 / 0.6 x 6 ,
so:
[ ( y 4 ) 0.7 1 ] R ˜ = γ = 1 2 [ ( y 4 ) 0.7 1 ] R ˜ γ = 0.5 / 0.7 + 1 / 0.6 x 1 + 1 / 0.5 x 2 + 1 / 0.3 x 3 + 1 / 0.7 x 4 + 1 / 0.3 x 5 + 1 / 0.6 x 6 .
By:
[ ( y 4 ) 0.7 1 ] R ˜ γ ( x i ) = z Y R γ * ( x i , z ) 1 [ 1 R γ ( x i , y 4 ) ] ( 1 0.7 ) , i = 1 , , 6 ; γ = 1 , 2 ,
we have:
[ ( y 4 ) 0.7 1 ] R ˜ 1 = 0.5 / 0.3 x 1 + 1 / 0.5 x 2 + 1 / 0.7 x 3 + 1 / 0.3 x 4 + 1 / 0.7 x 5 + 1 / 0.4 x 6 ,
[ ( y 4 ) 0.7 1 ] R ˜ 2 = 1 / 0.4 x 1 + 1 / 0.5 x 2 + 1 / 0.7 x 3 + 1 / 0.3 x 4 + 1 / 0.7 x 5 + 1 / 0.4 x 6 ,
so:
[ ( y 4 ) 0.7 1 ] R ˜ = γ = 1 2 [ ( y 4 ) 0.7 1 ] R ˜ γ = 0.5 / 0.3 + 1 / 0.4 x 1 + 1 / 0.5 x 2 + 1 / 0.7 x 3 + 1 / 0.3 x 4 + 1 / 0.7 x 5 + 1 / 0.4 x 6 .
[ ( y 4 ) 0.7 1 ] R ˜ and [ ( y 4 ) 0.7 1 ] R ˜ are depicted in Figure 2. Obviously, [ ( y 4 ) 0.7 1 ] R ˜ is exactly the complement of [ ( y 4 ) 0.7 1 ] R ˜ .
Theorem 2.
Let X and Y be two nonempty finite universes and R ˜ be a type-2 fuzzy relation from X to Y. If R ˜ γ is an embedded type-2 set of R ˜ and R γ is the corresponding embedded type-1 set, for y Y , λ 1 , λ 2 [ 0 , 1 ] , μ 1 , μ 2 ( 0 , 1 ] , we have:
1. 
[ y λ 1 μ 1 ] R ˜ γ [ y λ 2 μ 2 ] R ˜ γ = [ y λ 1 λ 2 μ 1 μ 2 ] R ˜ γ ;
2. 
[ y λ 1 μ 1 ] R ˜ γ [ y λ 2 μ 2 ] R ˜ γ = [ y λ 1 λ 2 μ 1 μ 2 ] R ˜ γ ;
3. 
[ y λ 1 μ 1 ] R ˜ γ [ y λ 2 μ 2 ] R ˜ γ = [ y λ 1 λ 2 μ 1 μ 2 ] R ˜ γ ;
4. 
[ y λ 1 μ 1 ] R ˜ γ [ y λ 2 μ 2 ] R ˜ γ = [ y λ 1 λ 2 μ 1 μ 2 ] R ˜ γ .
Proof. 
  • For any x X ,
    [ y λ 1 μ 1 ] R ˜ γ ( x ) [ y λ 2 μ 2 ] R ˜ γ ( x ) = z Y R γ * ( x , z ) μ 1 R γ ( x , y ) λ 1 z Y R γ * ( x , z ) μ 2 R γ ( x , y ) λ 2 = z Y R γ * ( x , z ) μ 1 μ 2 R γ ( x , y ) ( λ 1 λ 2 ) = [ y λ 1 λ 2 μ 1 μ 2 ] R ˜ γ ( x ) .
  • For any x X ,
    [ y λ 1 μ 1 ] R ˜ γ ( x ) [ y λ 2 μ 2 ] R ˜ γ ( x ) = z Y R γ * ( x , z ) μ 1 R γ ( x , y ) λ 1 z Y R γ * ( x , z ) μ 2 R γ ( x , y ) λ 2 = z Y R γ * ( x , z ) μ 1 μ 2 R γ ( x , y ) ( λ 1 λ 2 ) = [ y λ 1 λ 2 μ 1 μ 2 ] R ˜ γ ( x ) .
  • For any x X ,
    [ y λ 1 μ 1 ] R ˜ γ ( x ) [ y λ 2 μ 2 ] R ˜ γ ( x ) = z Y R γ * ( x , z ) μ 1 ( 1 R γ ( x , y ) ) ( 1 λ 1 ) z Y R γ * ( x , z ) μ 2 ( 1 R γ ( x , y ) ) ( 1 λ 2 ) = z Y R γ * ( x , z ) μ 1 μ 2 ( 1 R γ ( x , y ) ) [ 1 ( λ 1 λ 2 ) ] = [ y λ 1 λ 2 μ 1 μ 2 ] R ˜ γ ( x ) .
  • For any x X ,
    [ y λ 1 μ 1 ] R ˜ γ ( x ) [ y λ 2 μ 2 ] R ˜ γ ( x ) = z Y R γ * ( x , z ) μ 1 ( 1 R γ ( x , y ) ) ( 1 λ 1 ) z Y R γ * ( x , z ) μ 2 ( 1 R γ ( x , y ) ) ( 1 λ 2 ) = z Y R γ * ( x , z ) μ 1 μ 2 ( 1 R γ ( x , y ) ) [ 1 ( λ 1 λ 2 ) ] = [ y λ 1 λ 2 μ 1 μ 2 ] R ˜ γ ( x ) .
 ☐
Theorem 3.
Let X and Y be two nonempty finite universes. Suppose R ˜ ( 1 ) and R ˜ ( 2 ) are type-2 fuzzy relations from X to Y and R ˜ α and R ˜ β are embedded type-2 sets of R ˜ ( 1 ) and R ˜ ( 2 ) , respectively, then for y Y , λ [ 0 , 1 ] , μ ( 0 , 1 ] ,
1. 
[ y λ μ ] R ˜ α R ˜ β = [ y λ μ ] R ˜ α [ y λ μ ] R ˜ β ;
2. 
[ y λ μ ] R ˜ α R ˜ β = [ y λ μ ] R ˜ α [ y λ μ ] R ˜ β ;
3. 
[ y λ μ ] R ˜ α R ˜ β = [ y λ μ ] R ˜ α [ y λ μ ] R ˜ β ;
4. 
[ y λ μ ] R ˜ α R ˜ β = [ y λ μ ] R ˜ α [ y λ μ ] R ˜ β .
Proof. 
  • For any x X ,
    [ y λ μ ] R ˜ α R ˜ β ( x ) = z Y ( R α * ( x , z ) R β * ( x , z ) ) μ R α ( x , y ) R β ( x , y ) λ = [ z Y R α * ( x , z ) μ ] [ z Y R β * ( x , z ) μ ] [ R α ( x , y ) λ ] [ R β ( x , y ) λ ] = [ y λ μ ] R ˜ α ( x ) [ y λ μ ] R ˜ β ( x ) .
  • For any x X ,
    [ y λ μ ] R ˜ α R ˜ β ( x ) = z Y ( R α * ( x , z ) R β * ( x , z ) ) μ [ R α ( x , y ) R β ( x , y ) ] λ = [ z Y R α * ( x , z ) μ ] [ z Y R β * ( x , z ) μ ] [ R α ( x , y ) λ ] [ R β ( x , y ) λ ] = [ y λ μ ] R ˜ α ( x ) [ y λ μ ] R ˜ β ( x ) .
  • For any x X ,
    [ y λ μ ] R ˜ α R ˜ β ( x ) = z Y ( R α * ( x , z ) R β * ( x , z ) ) μ [ 1 R α ( x , y ) R β ( x , y ) ] ( 1 λ ) = [ z Y R α * ( x , z ) μ ] [ z Y R β * ( x , z ) μ ] [ ( 1 R α ( x , y ) ) ( 1 λ ) ] [ ( 1 R β ( x , y ) ) ( 1 λ ) ] = [ y λ μ ] R ˜ α ( x ) [ y λ μ ] R ˜ β ( x ) .
  • For any x X ,
    [ y λ μ ] R ˜ α R ˜ β ( x ) = z Y ( R α * ( x , z ) R β * ( x , z ) ) μ [ 1 R α ( x , y ) R β ( x , y ) ] ( 1 λ ) = [ z Y R α * ( x , z ) μ ] [ z Y R β * ( x , z ) μ ] [ ( 1 R α ( x , y ) ) ( 1 λ ) ] [ ( 1 R β ( x , y ) ) ( 1 λ ) ] = [ y λ μ ] R ˜ α ( x ) [ y λ μ ] R ˜ β ( x ) .
 ☐
Lemma 2.
Let X and Y be two nonempty finite universes. Suppose R ˜ is a type-2 fuzzy relation from X to Y, R ˜ γ is an embedded type-2 set of R ˜ and R γ is the corresponding embedded type-1 set. For y Y , λ 1 , λ 2 [ 0 , 1 ] , μ 1 , μ 2 ( 0 , 1 ] ,
1. 
If λ 1 λ 2 , μ 1 μ 2 , [ y λ 1 μ 1 ] R ˜ γ [ y λ 2 μ 2 ] R ˜ γ ;
2. 
If λ 1 λ 2 , μ 1 μ 2 , [ y λ 1 μ 1 ] R ˜ γ [ y λ 2 μ 2 ] R ˜ γ .
Proof. 
Obviously. ☐
Theorem 4.
Let R ˜ 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 B ˜ F ˜ ( Y ) , if R ˜ γ and B ˜ β are embedded type-2 sets of R ˜ and B ˜ respectively, we have:
R ˜ γ ¯ ( B ˜ β ) = y Y [ y B β ( y ) B β * ( y ) ] R ˜ γ ;
and:
R ˜ γ ̲ ( B ˜ β ) = y Y [ y B β c ( y ) B β * ( y ) ] R ˜ γ .
Proof. 
For any x X ,
y Y [ y B β ( y ) B β * ( y ) ] R ˜ γ ( x ) = y Y z Y R γ * ( x , z ) B β * ( y ) R γ ( x , y ) B β ( y ) = y Y [ R γ * ( x , y ) B β * ( y ) ] y Y [ R γ ( x , y ) B β ( y ) ] = R ˜ γ ¯ ( B ˜ β ) ( x ) .
y Y [ y B β c ( y ) B β * ( y ) ] R ˜ γ ( x ) = y Y z Y R γ * ( x , z ) B β * ( y ) [ 1 R γ ( x , y ) ] B β ( y ) = y Y [ R γ * ( x , y ) B β * ( y ) ] y Y [ ( 1 R γ ( x , y ) ) B β ( y ) ] = R ˜ γ ̲ ( B ˜ β ) ( x ) .
 ☐
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 [ x λ ] R T and [ x λ ] R S , 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 M R ˜ γ and M R ˜ γ 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, M R ˜ γ and M R ˜ γ 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 y B 1 ( y ) B ˜ 1 ( y ) for any y Y :
[ ( y 1 ) 1 1 ] R ˜ 1 = 0.5 / 0.4 x 1 + 1 / 0.7 x 2 + 1 / 0.5 x 3 + 1 / 0.4 x 4 + 1 / 0.3 x 5 + 1 / 0.1 x 6 , [ ( y 2 ) 0 1 ] R ˜ 1 = 0.5 / 0 x 1 + 1 / 0 x 2 + 1 / 0 x 3 + 1 / 0 x 4 + 1 / 0 x 5 + 1 / 0 x 6 , [ ( y 3 ) 1 1 ] R ˜ 1 = 0.5 / 0.4 x 1 + 1 / 0.2 x 2 + 1 / 0.6 x 3 + 1 / 0.5 x 4 + 1 / 0.7 x 5 + 1 / 0.8 x 6 , [ ( y 4 ) 0.7 1 ] R ˜ 1 = 0.5 / 0.7 x 1 + 1 / 0.5 x 2 + 1 / 0.3 x 3 + 1 / 0.7 x 4 + 1 / 0.3 x 5 + 1 / 0.6 x 6 , [ ( y 5 ) 1 1 ] R ˜ 1 = 0.5 / 0.3 x 1 + 1 / 0.8 x 2 + 1 / 0.7 x 3 + 1 / 0.5 x 4 + 1 / 0.6 x 5 + 1 / 0.3 x 6 , [ ( y 6 ) 0.5 1 ] R ˜ 1 = 0.5 / 0.2 x 1 + 1 / 0.5 x 2 + 1 / 0.1 x 3 + 1 / 0.3 x 4 + 1 / 0.5 x 5 + 1 / 0.2 x 6 ,
R ˜ 1 ¯ ( B ˜ 1 ) = y Y [ y B 1 ( y ) B 1 * ( y ) ] R ˜ 1 = 0.5 / 0.7 x 1 + 1 / 0.8 x 2 + 1 / 0.7 x 3 + 1 / 0.7 x 4 + 1 / 0.7 x 5 + 1 / 0.8 x 6 .
[ ( y 1 ) 0 1 ] R ˜ 1 = 0.5 / 1 x 1 + 1 / 1 x 2 + 1 / 1 x 3 + 1 / 1 x 4 + 1 / 1 x 5 + 1 / 1 x 6 , [ ( y 2 ) 0.8 0.5 ] R ˜ 1 = 0.5 / 0.4 x 1 + 0.5 / 0.7 x 2 + 0.5 / 0.8 x 3 + 0.5 / 0.4 x 4 + 0.5 / 0.5 x 5 + 0.5 / 0.3 x 6 , [ ( y 3 ) 0 1 ] R ˜ 1 = 0.5 / 1 x 1 + 1 / 1 x 2 + 1 / 1 x 3 + 1 / 1 x 4 + 1 / 1 x 5 + 1 / 1 x 6 , [ ( y 4 ) 0.3 1 ] R ˜ 1 = 0.5 / 0.7 x 1 + 1 / 0.7 x 2 + 1 / 0.7 x 3 + 1 / 0.7 x 4 + 1 / 0.7 x 5 + 1 / 0.7 x 6 , [ ( y 5 ) 0 1 ] R ˜ 1 = 0.5 / 1 x 1 + 1 / 1 x 2 + 1 / 1 x 3 + 1 / 1 x 4 + 1 / 1 x 5 + 1 / 1 x 6 , [ ( y 6 ) 0.5 1 ] R ˜ 1 = 0.5 / 0.8 x 1 + 1 / 0.5 x 2 + 1 / 0.9 x 3 + 1 / 0.7 x 4 + 1 / 0.5 x 5 + 1 / 0.8 x 6 ,
R ˜ 1 ̲ ( B ˜ 2 ) = y Y [ y B 2 c ( y ) B 2 * ( y ) ] R ˜ 1 = 0.5 / 0.4 x 1 + 0.5 / 0.5 x 2 + 0.5 / 0.7 x 3 + 0.5 / 0.4 x 4 + 0.5 / 0.5 x 5 + 0.5 / 0.3 x 6 .

5. Examples

Example 4.
Suppose X = { x 1 , x 2 , x 3 , x 4 } is a set of four different houses, all of which can be described by an attribute set Y = { y 1 , y 2 , y 3 , y 4 , y 5 } , where y 1 stands for S t r u c t u r e , y 2 stands for P o s i t i o n , y 3 stands for S u r r o u n d i n g f a c i l i t i e s , y 4 stands for P r i c e and y 5 stands for G r e e n i n g .
The correlation degree between X and Y (i.e., R ˜ ( x i , y j ) ) is given in Table 1.
Suppose A ˜ is a client who wants to purchase a house among the four alternative offers, and the demand of A ˜ can be described by a type-2 fuzzy set (Figure 3a):
A ˜ = 1 / 0.9 y 1 + 1 / 0.4 + 0.8 / 0.5 y 2 + 1 / 1 y 3 + 1 / 0.2 y 4 + 1 / 0.7 y 5 .
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 A ˜ .
Since R ˜ = R ˜ 1 + R ˜ 2 and A ˜ = A ˜ 1 + A ˜ 2 , where:
R ˜ 1 ( x i , y j ) = 1 / 1 1 / 0.8 1 / 0.3 1 / 0.9 1 / 0.6 1 / 0.6 1 / 0.3 1 / 0.8 1 / 1 1 / 0.4 1 / 0.4 1 / 0.6 1 / 0.5 1 / 1 1 / 0.8 1 / 1 1 / 0.5 1 / 0.6 1 / 0.3 1 / 0.7 ,
R ˜ 2 ( x i , y j ) = 1 / 1 1 / 0.8 0.5 / 0.4 1 / 0.9 1 / 0.6 1 / 0.6 1 / 0.3 1 / 0.8 1 / 1 1 / 0.4 1 / 0.4 1 / 0.6 1 / 0.5 1 / 1 1 / 0.8 1 / 1 1 / 0.5 1 / 0.6 1 / 0.3 1 / 0.7 ,
A ˜ 1 = 1 / 0.9 y 1 + 1 / 0.4 y 2 + 1 / 1 y 3 + 1 / 0.2 y 4 + 1 / 0.7 y 5 ,
A ˜ 2 = 1 / 0.9 y 1 + 0.8 / 0.5 y 2 + 1 / 1 y 3 + 1 / 0.2 y 4 + 1 / 0.7 y 5 ,
we have:
R ˜ 1 ̲ ( A ˜ 1 ) = 1 / 0.2 x 1 + 1 / 0.2 x 2 + 1 / 0.2 x 3 + 1 / 0.5 x 4 ,
R ˜ 1 ̲ ( A ˜ 2 ) = 0.8 / 0.2 x 1 + 0.8 / 0.2 x 2 + 0.8 / 0.2 x 3 + 0.8 / 0.5 x 4 ,
R ˜ 2 ̲ ( A ˜ 1 ) = 0.5 / 0.2 x 1 + 1 / 0.2 x 2 + 1 / 0.2 x 3 + 1 / 0.5 x 4 ,
and:
R ˜ 2 ̲ ( A ˜ 2 ) = 0.5 / 0.2 x 1 + 0.8 / 0.2 x 2 + 0.8 / 0.2 x 3 + 0.8 / 0.5 x 4 .
Thus,
R ˜ ̲ ( A ˜ ) = 1 / 0.2 x 1 + 1 / 0.2 x 2 + 1 / 0.2 x 3 + 1 / 0.5 x 4 .
From
R ˜ 1 ¯ ( A ˜ 1 ) = 1 / 0.9 x 1 + 1 / 0.8 x 2 + 1 / 0.7 x 3 + 1 / 0.9 x 4 ,
R ˜ 1 ¯ ( A ˜ 2 ) = 0.8 / 0.9 x 1 + 0.8 / 0.8 x 2 + 0.8 / 0.7 x 3 + 0.8 / 0.9 x 4 ,
R ˜ 2 ¯ ( A ˜ 1 ) = 0.5 / 0.9 x 1 + 1 / 0.8 x 2 + 1 / 0.7 x 3 + 1 / 0.9 x 4 ,
R ˜ 2 ¯ ( A ˜ 2 ) = 0.5 / 0.9 x 1 + 0.8 / 0.8 x 2 + 0.8 / 0.7 x 3 + 0.8 / 0.9 x 4 ,
we have:
R ˜ ¯ ( A ˜ ) = 1 / 0.9 x 1 + 1 / 0.8 x 2 + 1 / 0.7 x 3 + 1 / 0.9 x 4 .
Consequently (Figure 3b),
R ˜ ̲ ( A ˜ ) + R ˜ ¯ ( A ˜ ) = 1 / 0.2 + 1 / 0.9 x 1 + 1 / 0.2 + 1 / 0.8 x 2 + 1 / 0.2 + 1 / 0.7 x 3 + 1 / 0.5 + 1 / 0.9 x 4 .
Let:
T 1 = { i | max x i X { C ( R ˜ ̲ ( A ˜ ) ( x i ) ) } } ,
T 2 = { j | max x j X { C ( R ˜ ¯ ( A ˜ ) ( x j ) ) } } ,
T 3 = { k | max x k X { C ( [ R ˜ ̲ ( A ˜ ) + R ˜ ¯ ( A ˜ ) ] ( x k ) ) } } ,
where C ( R ˜ ̲ ( A ˜ ) ( x i ) ) is the centroid of R ˜ ̲ ( A ˜ ) ( x i ) .
If T 1 T 2 T 3 , then x i ( i T 1 T 2 T 3 ) is the best choice of A ˜ .
If T 1 T 2 T 3 = , then consider T 1 T 2 : if T 1 T 2 , we have that x i ( i T 1 T 2 ) is the best choice of A ˜ ; if T 1 T 2 = , we take x i ( i T 3 ) as the best choice of A ˜ [29].
Since T 1 = { 4 } , T 2 = { 1 , 4 } , T 3 = { 4 } , x 4 is the best house for A ˜ .
From the definition of A ˜ , it is clear that client A ˜ pays most attention to y 3 and y 1 , the surrounding facilities and the structure, and y 4 , price, is the least important factor. x 4 is the best house both in surrounding facilities and structure.
Consider another client for house purchasing (Figure 4a):
B ˜ = 1 / 0.6 y 1 + 1 / 0.5 y 2 + 1 / 0.3 + 1 / 0.4 y 3 + 1 / 0.7 y 4 + 1 / 0.2 y 5 .
Take:
B ˜ 1 = 1 / 0.6 y 1 + 1 / 0.5 y 2 + 1 / 0.3 y 3 + 1 / 0.7 y 4 + 1 / 0.2 y 5
and:
B ˜ 2 = 1 / 0.6 y 1 + 1 / 0.5 y 2 + 1 / 0.4 y 3 + 1 / 0.7 y 4 + 1 / 0.2 y 5 ,
Using the definition of granular type-2 fuzzy sets, we can compute the upper and lower approximations of B ˜ :
R ˜ ¯ ( B ˜ ) = R ˜ 1 ¯ ( B ˜ 1 ) + R ˜ 1 ¯ ( B ˜ 2 ) + R ˜ 2 ¯ ( B ˜ 1 ) + R ˜ 2 ¯ ( B ˜ 2 ) ,
R ˜ ̲ ( B ˜ ) = R ˜ 1 ̲ ( B ˜ 1 ) + R ˜ 1 ̲ ( B ˜ 2 ) + R ˜ 2 ̲ ( B ˜ 1 ) + R ˜ 2 ̲ ( B ˜ 2 ) ,
where:
R ˜ 1 ¯ ( B ˜ 1 ) = [ ( y 1 ) 0.6 1 ] R ˜ 1 [ ( y 2 ) 0.5 1 ] R ˜ 1 [ ( y 3 ) 0.3 1 ] R ˜ 1 [ ( y 4 ) 0.7 1 ] R ˜ 1 [ ( y 5 ) 0.2 1 ] R ˜ 1
R ˜ 1 ¯ ( B ˜ 2 ) = [ ( y 1 ) 0.6 1 ] R ˜ 1 [ ( y 2 ) 0.5 1 ] R ˜ 1 [ ( y 3 ) 0.4 1 ] R ˜ 1 [ ( y 4 ) 0.7 1 ] R ˜ 1 [ ( y 5 ) 0.2 1 ] R ˜ 1
R ˜ 2 ¯ ( B ˜ 1 ) = [ ( y 1 ) 0.6 1 ] R ˜ 2 [ ( y 2 ) 0.5 1 ] R ˜ 2 [ ( y 3 ) 0.3 1 ] R ˜ 2 [ ( y 4 ) 0.7 1 ] R ˜ 2 [ ( y 5 ) 0.2 1 ] R ˜ 2
R ˜ 2 ¯ ( B ˜ 2 ) = [ ( y 1 ) 0.6 1 ] R ˜ 2 [ ( y 2 ) 0.5 1 ] R ˜ 2 [ ( y 3 ) 0.4 1 ] R ˜ 2 [ ( y 4 ) 0.7 1 ] R ˜ 2 [ ( y 5 ) 0.2 1 ] R ˜ 2
R ˜ 1 ̲ ( B ˜ 1 ) = [ ( y 1 ) 0.4 1 ] R ˜ 1 [ ( y 2 ) 0.5 1 ] R ˜ 1 [ ( y 3 ) 0.7 1 ] R ˜ 1 [ ( y 4 ) 0.3 1 ] R ˜ 1 [ ( y 5 ) 0.8 1 ] R ˜ 1
R ˜ 1 ̲ ( B ˜ 1 ) = [ ( y 1 ) 0.4 1 ] R ˜ 1 [ ( y 2 ) 0.5 1 ] R ˜ 1 [ ( y 3 ) 0.6 1 ] R ˜ 1 [ ( y 4 ) 0.3 1 ] R ˜ 1 [ ( y 5 ) 0.8 1 ] R ˜ 1
R ˜ 2 ̲ ( B ˜ 1 ) = [ ( y 1 ) 0.4 1 ] R ˜ 2 [ ( y 2 ) 0.5 1 ] R ˜ 2 [ ( y 3 ) 0.7 1 ] R ˜ 2 [ ( y 4 ) 0.3 1 ] R ˜ 2 [ ( y 5 ) 0.8 1 ] R ˜ 2
R ˜ 2 ̲ ( B ˜ 1 ) = [ ( y 1 ) 0.4 1 ] R ˜ 2 [ ( y 2 ) 0.5 1 ] R ˜ 2 [ ( y 3 ) 0.6 1 ] R ˜ 2 [ ( y 4 ) 0.3 1 ] R ˜ 2 [ ( y 5 ) 0.8 1 ] R ˜ 2 .
and:
[ ( y 1 ) 0.6 1 ] R ˜ 1 = 1 / 0.6 x 1 + 1 / 0.6 x 2 + 1 / 0.4 x 3 + 1 / 0.6 x 4
[ ( y 2 ) 0.5 1 ] R ˜ 1 = 1 / 0.5 x 1 + 1 / 0.3 x 2 + 1 / 0.5 x 3 + 1 / 0.5 x 4
[ ( y 3 ) 0.3 1 ] R ˜ 1 = 1 / 0.3 x 1 + 1 / 0.3 x 2 + 1 / 0.3 x 3 + 1 / 0.3 x 4
[ ( y 4 ) 0.7 1 ] R ˜ 1 = 1 / 0.7 x 1 + 1 / 0.7 x 2 + 1 / 0.7 x 3 + 1 / 0.3 x 4
[ ( y 5 ) 0.2 1 ] R ˜ 1 = 1 / 0.2 x 1 + 1 / 0.2 x 2 + 1 / 0.2 x 3 + 1 / 0.2 x 4
[ ( y 3 ) 0.4 1 ] R ˜ 1 = 1 / 0.3 x 1 + 1 / 0.4 x 2 + 1 / 0.4 x 3 + 1 / 0.4 x 4
[ ( y 1 ) 0.6 1 ] R ˜ 2 = 0.5 / 0.6 x 1 + 1 / 0.6 x 2 + 1 / 0.4 x 3 + 1 / 0.6 x 4
[ ( y 2 ) 0.5 1 ] R ˜ 2 = 0.5 / 0.5 x 1 + 1 / 0.3 x 2 + 1 / 0.5 x 3 + 1 / 0.5 x 4
[ ( y 3 ) 0.3 1 ] R ˜ 2 = 0.5 / 0.3 x 1 + 1 / 0.3 x 2 + 1 / 0.3 x 3 + 1 / 0.3 x 4
[ ( y 4 ) 0.7 1 ] R ˜ 2 = 0.5 / 0.7 x 1 + 1 / 0.7 x 2 + 1 / 0.7 x 3 + 1 / 0.3 x 4
[ ( y 5 ) 0.2 1 ] R ˜ 2 = 0.5 / 0.2 x 1 + 1 / 0.2 x 2 + 1 / 0.2 x 3 + 1 / 0.2 x 4
[ ( y 3 ) 0.4 1 ] R ˜ 2 = 0.5 / 0.4 x 1 + 1 / 0.4 x 2 + 1 / 0.4 x 3 + 1 / 0.4 x 4
[ ( y 1 ) 0.4 1 ] R ˜ 1 = 1 / 0.6 x 1 + 1 / 0.6 x 2 + 1 / 0.6 x 3 + 1 / 0.6 x 4
[ ( y 2 ) 0.5 1 ] R ˜ 1 = 1 / 0.5 x 1 + 1 / 0.7 x 2 + 1 / 0.5 x 3 + 1 / 0.5 x 4
[ ( y 3 ) 0.7 1 ] R ˜ 1 = 1 / 0.7 x 1 + 1 / 0.3 x 2 + 1 / 0.5 x 3 + 1 / 0.4 x 4
[ ( y 4 ) 0.3 1 ] R ˜ 1 = 1 / 0.7 x 1 + 1 / 0.7 x 2 + 1 / 0.7 x 3 + 1 / 0.7 x 4
[ ( y 5 ) 0.8 1 ] R ˜ 1 = 1 / 0.4 x 1 + 1 / 0.6 x 2 + 1 / 0.2 x 3 + 1 / 0.3 x 4
[ ( y 3 ) 0.6 1 ] R ˜ 1 = 1 / 0.7 x 1 + 1 / 0.4 x 2 + 1 / 0.5 x 3 + 1 / 0.4 x 4
[ ( y 1 ) 0.4 1 ] R ˜ 2 = 0.5 / 0.6 x 1 + 1 / 0.6 x 2 + 1 / 0.6 x 3 + 1 / 0.6 x 4
[ ( y 2 ) 0.5 1 ] R ˜ 2 = 0.5 / 0.5 x 1 + 1 / 0.7 x 2 + 1 / 0.5 x 3 + 1 / 0.5 x 4
[ ( y 3 ) 0.7 1 ] R ˜ 2 = 0.5 / 0.6 x 1 + 1 / 0.3 x 2 + 1 / 0.5 x 3 + 1 / 0.4 x 4
[ ( y 4 ) 0.3 1 ] R ˜ 2 = 0.5 / 0.7 x 1 + 1 / 0.7 x 2 + 1 / 0.7 x 3 + 1 / 0.7 x 4
[ ( y 5 ) 0.8 1 ] R ˜ 2 = 0.5 / 0.4 x 1 + 1 / 0.6 x 2 + 1 / 0.2 x 3 + 1 / 0.3 x 4
[ ( y 3 ) 0.6 1 ] R ˜ 2 = 0.5 / 0.6 x 1 + 1 / 0.4 x 2 + 1 / 0.5 x 3 + 1 / 0.4 x 4 .
Then, we have:
R ˜ 1 ̲ ( B ˜ 1 ) = 1 / 0.4 x 1 + 1 / 0.3 x 2 + 1 / 0.2 x 3 + 1 / 0.3 x 4 ,
R ˜ 1 ̲ ( B ˜ 2 ) = 1 / 0.4 x 1 + 1 / 0.4 x 2 + 1 / 0.2 x 3 + 1 / 0.3 x 4 ,
R ˜ 2 ̲ ( B ˜ 1 ) = 0.5 / 0.4 x 1 + 1 / 0.3 x 2 + 1 / 0.2 x 3 + 1 / 0.3 x 4 ,
R ˜ 2 ̲ ( B ˜ 2 ) = 0.5 / 0.4 x 1 + 1 / 0.4 x 2 + 1 / 0.2 x 3 + 1 / 0.3 x 4 ,
and:
R ˜ ̲ ( B ˜ ) = 1 / 0.4 x 1 + 1 / 0.3 + 1 / 0.4 x 2 + 1 / 0.2 x 3 + 1 / 0.3 x 4 .
From:
R ˜ 1 ¯ ( B ˜ 1 ) = 1 / 0.7 x 1 + 1 / 0.7 x 2 + 1 / 0.7 x 3 + 1 / 0.6 x 4 ,
R ˜ 1 ¯ ( B ˜ 2 ) = 1 / 0.7 x 1 + 1 / 0.7 x 2 + 1 / 0.7 x 3 + 1 / 0.6 x 4 ,
R ˜ 2 ¯ ( B ˜ 1 ) = 0.5 / 0.7 x 1 + 1 / 0.7 x 2 + 1 / 0.7 x 3 + 1 / 0.6 x 4 ,
R ˜ 2 ¯ ( B ˜ 2 ) = 0.5 / 0.7 x 1 + 1 / 0.7 x 2 + 1 / 0.7 x 3 + 1 / 0.6 x 4 ,
we have:
R ˜ ¯ ( B ˜ ) = 1 / 0.7 x 1 + 1 / 0.7 x 2 + 1 / 0.7 x 3 + 1 / 0.6 x 4 .
Consequently (Figure 4b),
R ˜ ̲ ( B ˜ ) + R ˜ ¯ ( B ˜ ) = 1 / 0.4 + 1 / 0.7 x 1 + 1 / 0.3 + 1 / 0.4 + 1 / 0.7 x 2 + 1 / 0.2 + 1 / 0.7 x 3 + 1 / 0.3 + 1 / 0.6 x 4 .
Since T 1 = { 1 } , T 2 = { 1 , 2 , 3 } , T 3 = { 1 } , x 1 is the best house for B ˜ .
For client B ˜ , the most important factors are y 4 and y 1 , the price and the structure; the least important factor is y 5 , the greening. The above method considered all the requirements of the client: the choice x 1 is of good behavior in y 4 and y 1 ; whereas, x 2 and x 3 are affordable, but not well structured. Figure 4a depicts the demand of B ˜ , and Figure 4b depicts R ˜ ¯ ( B ˜ ) and R ˜ ̲ ( B ˜ ) . It can be seen from Figure 4b that the memberships of x 1 are largest in both R ˜ ¯ ( B ˜ ) and R ˜ ̲ ( B ˜ ) . That is to say, x 1 is the best choice of client B ˜ .
Example 5.
We use an emergency decision-making problem to illustrate the application of type-2 fuzzy rough sets over two universes. Since emergency management is closely related to social stability and economic development, many studies have been conducted on it. In this example, we use the granular type-2 fuzzy sets of type-2 fuzzy rough sets to analyze such a problem and compare it to the model of fuzzy rough set on probabilistic approximation space over two universes proposed by Sun et al. in [33].
Unconventional emergency events, such as tornadoes, typhoons, earthquakes and floods, often occur unexpectedly, and the severity and extent of the impact are difficult to describe precisely. Approaches to handling uncertainty and incomplete data and information can be used to study the emergency decision-making problem.
Sun et al. [33] investigated the application of fuzzy rough set on probabilistic approximation space over two universes by an emergency decision-making problem. In order to compare with their method, we use a similar example in this section with some data modified.
Consider an emergency decision-making problem during an earthquake and suppose that the area affected can be divided into several different disaster areas according to the administrative district or the distribution of geography. We use X = { x 1 , , x 6 } to denote the set of disaster areas. The general characteristic factors that are used to describe the emergency event are denoted by Y = { y 1 , , y 7 } , where y 1 stands for Affected population, y 2 stands for Economic loss, y 3 stands for Risk of occurrence of a new disaster, y 4 stands for Damage to transportation, y 5 stands for Number of destroyed facilities, y 6 stands for Possibility of a disease outbreak and y 7 stands for Weather conditions. The degree of the relationship between these characteristic factors and the disaster areas is available based on history records about past earthquakes. For the convenience of comparison, we use the data given in [33], which are presented in Table 2. The larger the value of R ( x i , y j ) , the more important the characteristic y j for the area x i . For example, R ( x 5 , y 1 ) = 0.2 < 0.7 = R ( x 4 , y 1 ) implies that more population is affected in area x 4 than in x 5 .
In [33], A = 0.2 y 1 + 0.8 y 2 + 0.5 y 3 + 0.3 y 4 + 0.6 y 5 + 0.1 y 6 + 0.9 y 7 is the fuzzy description of all the characteristic factors, and the conclusion is: (1) x 2 , x 3 and x 5 are the most seriously affected areas, which need immediate rescue; (2) x 4 does not need rescue immediately; (3) the situation of x 6 and x 1 cannot be decided because of insufficient information.
Since we cannot acquire accurate and sufficient information immediately after the earthquake, if the exact memberships for those characteristic factors are unavailable, the information collected after a new earthquake can be described by a type-2 fuzzy set A ˜ on Y:
A ˜ = 1 / 0.2 y 1 + 1 / 0.8 y 2 + 1 / 0.5 + 0.8 / 0.6 y 3 + 1 / 0.3 y 4 + 1 / 0.6 y 5 + 1 / 0.1 + 0.5 / 0.2 y 6 + 1 / 0.8 + 1 / 0.9 y 7 .
By the wavy-slice representation of a type-2 fuzzy set,
A ˜ = β = 1 8 A ˜ β ,
where:
A ˜ 1 = 1 / 0.2 y 1 + 1 / 0.8 y 2 + 1 / 0.5 y 3 + 1 / 0.3 y 4 + 1 / 0.6 y 5 + 1 / 0.1 y 6 + 1 / 0.8 y 7 , A ˜ 2 = 1 / 0.2 y 1 + 1 / 0.8 y 2 + 0.8 / 0.6 y 3 + 1 / 0.3 y 4 + 1 / 0.6 y 5 + 1 / 0.1 y 6 + 1 / 0.8 y 7 , A ˜ 3 = 1 / 0.2 y 1 + 1 / 0.8 y 2 + 1 / 0.5 y 3 + 1 / 0.3 y 4 + 1 / 0.6 y 5 + 0.5 / 0.2 y 6 + 1 / 0.8 y 7 , A ˜ 4 = 1 / 0.2 y 1 + 1 / 0.8 y 2 + 1 / 0.5 y 3 + 1 / 0.3 y 4 + 1 / 0.6 y 5 + 1 / 0.1 y 6 + 1 / 0.9 y 7 , A ˜ 5 = 1 / 0.2 y 1 + 1 / 0.8 y 2 + 1 / 0.5 y 3 + 1 / 0.3 y 4 + 1 / 0.6 y 5 + 0.5 / 0.2 y 6 + 1 / 0.9 y 7 , A ˜ 6 = 1 / 0.2 y 1 + 1 / 0.8 y 2 + 0.8 / 0.6 y 3 + 1 / 0.3 y 4 + 1 / 0.6 y 5 + 1 / 0.1 y 6 + 1 / 0.9 y 7 , A ˜ 7 = 1 / 0.2 y 1 + 1 / 0.8 y 2 + 0.8 / 0.6 y 3 + 1 / 0.3 y 4 + 1 / 0.6 y 5 + 0.5 / 0.2 y 6 + 1 / 0.8 y 7 , A ˜ 8 = 1 / 0.2 y 1 + 1 / 0.8 y 2 + 0.8 / 0.6 y 3 + 1 / 0.3 y 4 + 1 / 0.6 y 5 + 0.5 / 0.2 y 6 + 1 / 0.9 y 7 .
Then, we present a procedure for the emergency decision-making problem based on the granular type-2 fuzzy sets of type-2 fuzzy rough sets over two universes.
Step 1.
Computing all the granular type-2 fuzzy sets [ ( y j ) A β ( y j ) A β * ( y j ) ] R , ( β = 1 , , 8 ; j = 1 , , 7 ) (Table 3);
Step 2.
Computing R ¯ ( A ˜ β ) = j = 1 7 [ ( y j ) A β ( y j ) A β * ( y j ) ] R for β = 1 , , 8 (Table 4);
Step 3.
Computing R ¯ ( A ˜ ) = β = 1 8 R ¯ ( A ˜ β ) (Table 5);
Step 4.
Computing all the granular type-2 fuzzy sets [ ( y j ) A β c ( y j ) A β * ( y j ) ] R , ( β = 1 , , 8 ; j = 1 , , 7 ) (Table 6);
Step 5.
Computing R ̲ ( A ˜ β ) = j = 1 7 [ ( y j ) A β c ( y j ) A β * ( y j ) ] R for β = 1 , , 8 (Table 7);
Step 6.
Computing R ̲ ( A ˜ ) = β = 1 8 R ̲ ( A ˜ β ) (Table 8);
Step 7.
Computing sum of R ¯ ( A ˜ ) and R ̲ ( A ˜ ) (Table 9);
Step 8.
Making the decision according to:
T 1 = { i | max x i X { C ( R ˜ ̲ ( A ˜ ) ( x i ) ) } } ,
T 2 = { i | max x i X { C ( R ˜ ¯ ( A ˜ ) ( x i ) ) } } ,
T 3 = { i | max x i X { C ( [ R ˜ ̲ ( A ˜ ) + R ˜ ¯ ( A ˜ ) ] ( x i ) ) } } ,
where C is the centroid of fuzzy sets. If T 1 T 2 T 3 , then x i ( i T 1 T 2 T 3 ) is the most seriously affected areas. If T 1 T 2 T 3 = , then consider T 1 T 2 : if T 1 T 2 , we have x i ( i T 1 T 2 ) is the most seriously affected areas; if T 1 T 2 = , we take x i ( i T 2 ) as the most seriously affected areas [29].
Since T 1 = { x 6 } , T 2 = { x 3 } , T 3 = { x 6 } , x 3 is the most seriously affected area, which needs to be rescued immediately. Since { 4 } = { i | min x i X { C ( R ¯ ( A ) ( x i ) ) } } = { i | min x i X { C ( R ̲ ( A ) ( x i ) ) } } = { i | min x i X { C ( [ R ¯ ( A ) + R ̲ ( A ) ] ( x i ) ) } } , x 4 is the least seriously affected area.
In Table 3, the maximums for every granular type-2 fuzzy sets have been highlighted in bold. We have the following conclusion:
1. 
Considering characteristic factor y 1 , all the areas are equally serious;
2. 
Considering characteristic factor y 2 , area x 5 and area x 6 are more serious;
3. 
Considering characteristic factor y 3 , area x 2 and area x 3 are more serious;
4. 
Considering characteristic factor y 4 , area x 1 and area x 5 are more serious;
5. 
Considering characteristic factor y 5 , area x 5 is more serious;
6. 
Considering characteristic factor y 6 , area x 5 and area x 6 are more serious;
7. 
Considering characteristic factor y 7 , area x 3 is more serious;
8. 
Area x 3 is serious in the aspect of y 3 (risk of occurrence of a new disaster) and y 7 (weather conditions);
9. 
Area x 4 is the least serious area.
Consider another type-2 fuzzy description for an earthquake:
B ˜ = 0.6 / 0.7 + 1 / 0.8 y 1 + 1 / 0.2 + 1 / 0.3 y 2 + 1 / 0.5 y 3 + 1 / 0.7 y 4 + 1 / 0.4 y 5 + 0.5 / 0.6 + 1 / 0.9 y 6 + 1 / 0.1 y 7 .
By the wavy-slice representation of type-2 fuzzy sets, B ˜ can be represented as B ˜ = β = 1 8 B ˜ β , where:
B ˜ 1 = 0.6 / 0.7 y 1 + 1 / 0.2 y 2 + 1 / 0.5 y 3 + 1 / 0.7 y 4 + 1 / 0.4 y 5 + 0.5 / 0.6 y 6 + 1 / 0.1 y 7 , B ˜ 2 = 1 / 0.8 y 1 + 1 / 0.2 y 2 + 1 / 0.5 y 3 + 1 / 0.7 y 4 + 1 / 0.4 y 5 + 0.5 / 0.6 y 6 + 1 / 0.1 y 7 , B ˜ 3 = 0.6 / 0.7 y 1 + 1 / 0.3 y 2 + 1 / 0.5 y 3 + 1 / 0.7 y 4 + 1 / 0.4 y 5 + 0.5 / 0.6 y 6 + 1 / 0.1 y 7 , B ˜ 4 = 0.6 / 0.7 y 1 + 1 / 0.2 y 2 + 1 / 0.5 y 3 + 1 / 0.7 y 4 + 1 / 0.4 y 5 + 1 / 0.9 y 6 + 1 / 0.1 y 7 , B ˜ 5 = 0.6 / 0.7 y 1 + 1 / 0.3 y 2 + 1 / 0.5 y 3 + 1 / 0.7 y 4 + 1 / 0.4 y 5 + 1 / 0.9 y 6 + 1 / 0.1 y 7 , B ˜ 6 = 1 / 0.8 y 1 + 1 / 0.2 y 2 + 1 / 0.5 y 3 + 1 / 0.7 y 4 + 1 / 0.4 y 5 + 1 / 0.9 y 6 + 1 / 0.1 y 7 , B ˜ 7 = 1 / 0.8 y 1 + 1 / 0.3 y 2 + 1 / 0.5 y 3 + 1 / 0.7 y 4 + 1 / 0.4 y 5 + 0.5 / 0.6 y 6 + 1 / 0.1 y 7 , B ˜ 8 = 1 / 0.8 y 1 + 1 / 0.3 y 2 + 1 / 0.5 y 3 + 1 / 0.7 y 4 + 1 / 0.4 y 5 + 1 / 0.9 y 6 + 1 / 0.1 y 7 .
Similar to the above procedure, we should compute T 1 , T 2 , T 3 , and the computation process is presented in the following tables (Table 10, Table 11, Table 12, Table 13, Table 14, Table 15 and Table 16):
In Table 10, the maximums for every granular type-2 fuzzy sets have been highlighted in bold. We have the following conclusion:
1. 
Considering characteristic factor y 1 , x 4 is more serious;
2. 
Considering characteristic factor y 2 , x 1 is the least serious area;
3. 
Considering characteristic factor y 3 , x 2 and x 3 are more serious;
4. 
Considering characteristic factor y 4 , x 1 is more serious;
5. 
Considering characteristic factor y 5 , x 5 is more serious;
6. 
Considering characteristic factor y 6 , x 5 is more serious;
7. 
Considering characteristic factor y 7 , all the areas are equally serious;
8. 
Area x 4 is serious in the respect of y 1 (affected population) and y 2 (economic loss).
Since T 1 = T 2 = T 3 = { x 4 } , x 4 is the most seriously affected area and needs immediate rescue.
In [33], the description of an earthquake is a fuzzy set:
A = 0.2 y 1 + 0.8 y 2 + 0.5 y 3 + 0.3 y 4 + 0.6 y 5 + 0.1 y 6 + 0.9 y 7 ,
that is to say, exact memberships of the characteristic factors y i ( i = 1 , , 7 ) have been decided by the information acquired after the earthquake. However, if the information is insufficient and the memberships of some factors cannot be decided, we have to take fuzzy sets as membership functions of those factors. In this example, we consider such conditions and use type-2 fuzzy sets as the descriptions of emergency events:
A ˜ = 1 / 0.2 y 1 + 1 / 0.8 y 2 + 1 / 0.5 + 0.8 / 0.6 y 3 + 1 / 0.3 y 4 + 1 / 0.6 y 5 + 1 / 0.1 + 0.5 / 0.2 y 6 + 1 / 0.8 + 1 / 0.9 y 7
and:
B ˜ = 0.6 / 0.7 + 1 / 0.8 y 1 + 1 / 0.2 + 1 / 0.3 y 2 + 1 / 0.5 y 3 + 1 / 0.7 y 4 + 1 / 0.4 y 5 + 0.5 / 0.6 + 1 / 0.9 y 6 + 1 / 0.1 y 7 .
A reasonable decision-making process for the unconventional emergency event has been made using the type-2 fuzzy rough sets over two universes. For the type-2 fuzzy description A ˜ , whose secondary membership functions are equal to or close to the corresponding memberships of the fuzzy description A, the decision is similar to that of [33], whereas for the type-2 fuzzy description B ˜ , whose secondary membership functions are equal to or close to the corresponding memberships of the complement of A, i.e., A c = 0.8 y 1 + 0.2 y 2 + 0.5 y 3 + 0.7 y 4 + 0.4 y 5 + 0.9 y 6 + 0.1 y 7 , an almost opposite conclusion has been made. Furthermore, the granular type-2 fuzzy sets make it possible to analyze the problem from each aspect.

6. Conclusions

Rough set theory is a method of granular computing, and equivalence classes are basic granules that can be used to approximate a set. Whether the granular structure of type-2 fuzzy rough sets over two universes is as clear as that of classical rough sets is what the authors want to discuss. At first, the definition of a type-2 fuzzy rough set over two different universes is proposed based on a general type-2 fuzzy relation from one universe to another, and the lower and upper approximations of a type-2 fuzzy set are defined in terms of membership functions. Then, two granular type-2 fuzzy sets are defined for an arbitrary type-2 fuzzy point, which are proven to be analogous to equivalence classes and complements of equivalence classes of rough sets respectively, since they can be used to express the upper and lower approximations of a type-2 fuzzy set by the operators union and intersection. Therefore, these granular type-2 fuzzy sets are the basic granules of type-2 fuzzy rough sets and can be considered to be type-2 fuzzy equivalence classes and complements of type-2 fuzzy equivalence classes of a type-2 fuzzy point. The authors discussed the properties of the upper and lower type-2 fuzzy rough approximation operators and the granular type-2 fuzzy sets. Two illustrative examples showed some simple applications of the model proposed in this paper. Future work by the authors will consider the practical application of the granular structure of type-2 fuzzy rough sets over two universes.

Acknowledgments

The authors would like to thank the anonymous referees for their valuable comments and suggestions, which have significantly improved the quality and presentation of this paper. The works described in this paper are supported by the National Natural Science Foundation of China (Nos. 61672331, 61573231, U1435212 and 61432011) and Shanxi Science and Technology Infrastructure (2015091001-0102).

Author Contributions

Juan Lu is the principal investigator of this work, and she wrote this manuscript. De-Yu Li provided some important suggestions and checked the whole manuscript. Yan-Hui Zhai and He-Xiang Bai provided several suggestions for improving the quality of this manuscript. All authors revised and approved the publication.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Chen, C.P.; Zhang, C.Y. Data-intensive applications, challenges, techniques and technologies: A survey on Big Data. Inf. Sci. 2014, 275, 314–347. [Google Scholar] [CrossRef]
  2. Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
  3. Dubois, D.; Prade, H. Rough fuzzy sets and fuzzy rough sets. Int. J. Gen. Syst. 1990, 17, 191–209. [Google Scholar] [CrossRef]
  4. Radzikowska, A.M.; Kerre, E.E. A comparative study of fuzzy rough sets. Fuzzy Sets Syst. 2002, 126, 137–155. [Google Scholar] [CrossRef]
  5. Deng, T.Q.; Chen, Y.M.; Xu, W.L.; Dai, Q.H. A novel approach to fuzzy rough sets based on a fuzzy covering. Inf. Sci. 2007, 177, 2308–2326. [Google Scholar] [CrossRef]
  6. Liu, G.L. Using one axiom to characterize rough set and fuzzy rough set approximations. Inf. Sci. 2013, 223, 285–296. [Google Scholar] [CrossRef]
  7. Chen, D.G.; Zhang, L.; Zhao, S.Y.; Hu, Q.H.; Zhu, P.F. A Novel Algorithm for Finding Reducts with Fuzzy Rough Sets. IEEE Trans. Fuzzy Syst. 2012, 20, 385–389. [Google Scholar] [CrossRef]
  8. Dai, J.H.; Xu, Q. Attribute selection based on information gain ratio in fuzzy rough set theory with application to tumor classification. Appl. Soft Comput. 2013, 13, 211–221. [Google Scholar] [CrossRef]
  9. Parthaláin, N.M.; Jensen, R. Unsupervised fuzzy-rough set-based dimensionality reduction. Inf. Sci. 2013, 229, 106–121. [Google Scholar] [CrossRef]
  10. Chen, D.G.; Kwong, S.; He, Q.; Wang, H. Geometrical interpretation and applications of membership functions with fuzzy rough sets. Fuzzy Sets Syst. 2012, 193, 122–135. [Google Scholar] [CrossRef]
  11. Hu, Q.H.; Zhang, L.; An, S.; Zhang, D.; Yu, D. On Robust Fuzzy Rough Set Models. IEEE Trans. Fuzzy Syst. 2012, 20, 636–651. [Google Scholar] [CrossRef]
  12. Tiwari, S.P.; Srivastava, A.K. Fuzzy rough sets, fuzzy preorders and fuzzy topologies. Fuzzy Sets Syst. 2013, 210, 63–68. [Google Scholar] [CrossRef]
  13. El-Latif, A.A.A.; Ramadan, A.A. On L-Double Fuzzy rough sets. Iran. J. Fuzzy Syst. 2016, 13, 125–142. [Google Scholar]
  14. Morsi, N.N.; Yakout, M.M. Axiomatics for fuzzy rough sets. Fuzzy Sets Syst. 1998, 100, 327–342. [Google Scholar] [CrossRef]
  15. Ludmila, K. Fuzzy rough sets: Application to features selection. Fuzzy Sets Syst. 1992, 51, 147–153. [Google Scholar]
  16. Wu, W.Z.; Mi, J.S.; Zhang, W.X. Generalized fuzzy rough sets. Inf. Sci. 2003, 151, 263–282. [Google Scholar] [CrossRef]
  17. Wu, W.Z.; Zhang, W.X. Constructive and axiomatic approaches of fuzzy approximation operators. Inf. Sci. 2004, 159, 233–254. [Google Scholar] [CrossRef]
  18. Mi, J.S.; Zhang, W.X. An axiomatic characterization of a fuzzy generalization of rough sets. Inf. Sci. 2004, 160, 235–249. [Google Scholar] [CrossRef]
  19. Yeung, D.S.; Chen, D.G.; Tsang, E.C.C.; Lee, J.W.T.; Wang, X.Z. On the Generalization of Fuzzy Rough Sets. IEEE Trans. Fuzzy Syst. 2005, 13, 343–361. [Google Scholar] [CrossRef]
  20. Chen, D.G.; Yang, Y.P.; Wang, H. Granular computing based on fuzzy similarity relations. Soft Comput. 2011, 15, 1161–1172. [Google Scholar]
  21. Zadeh, L.A. The concept of a linguistic variable and its application to approximate reasoning-1. Inf. Sci. 1975, 8, 199–249. [Google Scholar] [CrossRef]
  22. Wang, C.Y. Type-2 fuzzy rough sets based on extended t-norms. Inf. Sci. 2015, 305, 165–183. [Google Scholar] [CrossRef]
  23. Zhao, T.; Xiao, J. General type-2 fuzzy rough sets based on α-plane Representation theory. Soft Comput. 2014, 18, 227–237. [Google Scholar] [CrossRef]
  24. Lu, J.; Li, D.Y.; Zhai, Y.H.; Li, H.; Bai, H.X. A model for type-2 fuzzy rough sets. Inf. Sci. 2016, 328, 359–377. [Google Scholar] [CrossRef]
  25. Zhang, H.Y.; Zhang, W.X.; Wu, W.Z. On characterization of generalized interval-valued fuzzy rough sets on two universes of discourse. Int. J. Approx. Reason. 2009, 51, 56–70. [Google Scholar] [CrossRef]
  26. Sun, B.Z.; Ma, W.M. Fuzzy rough set model on two different universes and its application. Appl. Math. Model. 2011, 35, 1798–1809. [Google Scholar] [CrossRef]
  27. Liu, C.H.; Miao, D.Q.; Zhang, N. Graded rough set model based on two universes and its properties. Knowl.-Based Syst. 2012, 33, 65–72. [Google Scholar] [CrossRef]
  28. Ma, W.M.; Sun, B.Z. Probabilistic rough set over two universes and rough entropy. Int. J. Approx. Reason. 2012, 53, 608–619. [Google Scholar] [CrossRef]
  29. Sun, B.Z.; Ma, W.M.; Zhao, H.Y. A fuzzy rough set approach to emergency material demand prediction over two universes. Appl. Math. Model. 2013, 37, 7062–7070. [Google Scholar] [CrossRef]
  30. Yang, H.L.; Liao, X.W.; Wang, S.Y.; Wang, J. Fuzzy probabilistic rough set model on two universes and its applications. Int. J. Approx. Reason. 2013, 54, 1410–1420. [Google Scholar] [CrossRef]
  31. Mendel, J.M. Advances in type-2 fuzzy sets and systems. Inf. Sci. 2007, 177, 84–110. [Google Scholar] [CrossRef]
  32. Mendel, J.M.; John, R.I.B. Type-2 fuzzy sets made simple. IEEE Trans. Fuzzy Syst. 2002, 10, 117–127. [Google Scholar] [CrossRef]
  33. Sun, B.Z.; Ma, W.M.; Chen, X.T. Fuzzy rough set on probabilistic approximation space over two universes and its application to emergency decision-making. Exp. Syst. 2015, 32, 507–521. [Google Scholar] [CrossRef]
Figure 1. (a) A type-2 fuzzy set B ˜ , which is defined in Y; (b) the lower approximation and the upper approximation of B ˜ with respect to ( X , Y , R ˜ ) , which are type-2 fuzzy sets defined in X. The solid lines depict the upper approximation R ˜ ¯ ( B ˜ ) ; the dotted line depicts the lower approximation R ˜ ̲ ( B ˜ ) .
Figure 1. (a) A type-2 fuzzy set B ˜ , which is defined in Y; (b) the lower approximation and the upper approximation of B ˜ with respect to ( X , Y , R ˜ ) , which are type-2 fuzzy sets defined in X. The solid lines depict the upper approximation R ˜ ¯ ( B ˜ ) ; the dotted line depicts the lower approximation R ˜ ̲ ( B ˜ ) .
Symmetry 09 00284 g001
Figure 2. The solid lines depict [ ( y 4 ) 0.7 1 ] R ˜ and the dotted lines depict [ ( y 4 ) 0.7 1 ] R ˜ .
Figure 2. The solid lines depict [ ( y 4 ) 0.7 1 ] R ˜ and the dotted lines depict [ ( y 4 ) 0.7 1 ] R ˜ .
Symmetry 09 00284 g002
Figure 3. (a) Demand of client A ˜ ; (b) the lower approximation and the upper approximation of A ˜ , which are type-2 fuzzy sets defined in X. The solid line depicts the upper approximation R ˜ ¯ ( A ˜ ) ; the dotted line depicts the lower approximation R ˜ ̲ ( A ˜ ) .
Figure 3. (a) Demand of client A ˜ ; (b) the lower approximation and the upper approximation of A ˜ , which are type-2 fuzzy sets defined in X. The solid line depicts the upper approximation R ˜ ¯ ( A ˜ ) ; the dotted line depicts the lower approximation R ˜ ̲ ( A ˜ ) .
Symmetry 09 00284 g003aSymmetry 09 00284 g003b
Figure 4. (a) Demand of client B ˜ ; (b) the lower approximation and the upper approximation of B ˜ , which are type-2 fuzzy sets defined in X. The solid line depicts the upper approximation R ˜ ¯ ( B ˜ ) ; the dotted lines depict the lower approximation R ˜ ̲ ( B ˜ ) .
Figure 4. (a) Demand of client B ˜ ; (b) the lower approximation and the upper approximation of B ˜ , which are type-2 fuzzy sets defined in X. The solid line depicts the upper approximation R ˜ ¯ ( B ˜ ) ; the dotted lines depict the lower approximation R ˜ ̲ ( B ˜ ) .
Symmetry 09 00284 g004
Table 1. Correlation degree between x i and y j .
Table 1. Correlation degree between x i and y j .
X Y y 1 y 2 y 3 y 4 y 5
x 1 1/11/0.81/0.3 + 0.5/0.41/0.91/0.6
x 2 1/0.61/0.31/0.81/11/0.4
x 3 1/0.41/0.61/0.51/11/0.8
x 4 1/11/0.51/0.61/0.31/0.7
Table 2. Fuzzy relation R from X to Y.
Table 2. Fuzzy relation R from X to Y.
R ( x i , y j ) y 1 y 2 y 3 y 4 y 5 y 6 y 7
x 1 0.30.10.40.40.10.10.5
x 2 0.30.30.50.10.30.10.5
x 3 0.40.30.50.10.30.10.6
x 4 0.70.40.20.10.20.10.3
x 5 0.20.50.20.30.50.50.4
x 6 0.30.50.20.20.20.30.3
Table 3. Granular type-2 fuzzy sets [ ( y j ) A β ( y j ) A β * ( y j ) ] R .
Table 3. Granular type-2 fuzzy sets [ ( y j ) A β ( y j ) A β * ( y j ) ] R .
[ ( y j ) A β ( y j ) A β * ( y j ) ] R x 1 x 2 x 3 x 4 x 5 x 6
[ ( y 1 ) 0.2 1 ] R 1/0.21/0.21/0.21/0.21/0.21/0.2
[ ( y 2 ) 0.8 1 ] R 1/0.11/0.31/0.31/0.41/0.51/0.5
[ ( y 3 ) 0.5 1 ] R 1/0.41/0.51/0.51/0.21/0.21/0.2
[ ( y 3 ) 0.6 0.8 ] R 0.8/0.40.8/0.50.8/0.50.8/0.20.8/0.20.8/0.2
[ ( y 4 ) 0.3 1 ] R 1/0.31/0.11/0.11/0.11/0.31/0.2
[ ( y 5 ) 0.6 1 ] R 1/0.11/0.31/0.31/0.21/0.51/0.2
[ ( y 6 ) 0.1 1 ] R 1/0.11/0.11/0.11/0.11/0.11/0.1
[ ( y 6 ) 0.2 0.5 ] R 0.5/0.10.5/0.10.5/0.10.5/0.10.5/0.20.5/0.2
[ ( y 7 ) 0.8 1 ] R 1/0.51/0.51/0.61/0.31/0.41/0.3
[ ( y 7 ) 0.9 1 ] R 1/0.51/0.51/0.61/0.31/0.41/0.3
Table 4. The upper approximations R ¯ ( A ˜ β ) .
Table 4. The upper approximations R ¯ ( A ˜ β ) .
R ¯ ( A ˜ β ) x 1 x 2 x 3 x 4 x 5 x 6
R ¯ ( A ˜ 1 ) 1/0.51/0.51/0.61/0.41/0.51/0.5
R ¯ ( A ˜ 2 ) 0.8/0.50.8/0.50.8/0.60.8/0.40.8/0.50.8/0.5
R ¯ ( A ˜ 3 ) 0.5/0.50.5/0.50.5/0.60.5/0.40.5/0.50.5/0.5
R ¯ ( A ˜ 4 ) 1/0.51/0.51/0.61/0.41/0.51/0.5
R ¯ ( A ˜ 5 ) 0.5/0.50.5/0.50.5/0.60.5/0.40.5/0.50.5/0.5
R ¯ ( A ˜ 6 ) 0.8/0.50.8/0.50.8/0.60.8/0.40.8/0.50.8/0.5
R ¯ ( A ˜ 7 ) 0.5/0.50.5/0.50.5/0.60.5/0.40.5/0.50.5/0.5
R ¯ ( A ˜ 8 ) 0.5/0.50.5/0.50.5/0.60.5/0.40.5/0.50.5/0.5
Table 5. The upper approximation R ¯ ( A ˜ ) .
Table 5. The upper approximation R ¯ ( A ˜ ) .
x 1 x 2 x 3 x 4 x 5 x 6
R ¯ ( A ˜ ) ( x i ) 1/0.51/0.51/0.61/0.41/0.51/0.5
C ( R ¯ ( A ˜ ) ( x i ) ) 0.50.50.60.40.50.5
Table 6. Granular type-2 fuzzy sets [ ( y j ) A β c ( y j ) A β * ( y j ) ] R .
Table 6. Granular type-2 fuzzy sets [ ( y j ) A β c ( y j ) A β * ( y j ) ] R .
[ ( y j ) A β c ( y j ) A β * ( y j ) ] R x 1 x 2 x 3 x 4 x 5 x 6
[ ( y 1 ) 0.8 1 ] R 1/0.71/0.71/0.61/0.31/0.81/0.7
[ ( y 2 ) 0.2 1 ] R 1/0.91/0.81/0.81/0.81/0.81/0.8
[ ( y 3 ) 0.5 1 ] R 1/0.61/0.51/0.51/0.81/0.81/0.8
[ ( y 3 ) 0.4 0.8 ] R 0.8/0.60.8/0.60.8/0.60.8/0.80.8/0.80.8/0.8
[ ( y 4 ) 0.7 1 ] R 1/0.61/0.91/0.91/0.91/0.71/0.8
[ ( y 5 ) 0.4 1 ] R 1/0.91/0.71/0.71/0.81/0.61/0.8
[ ( y 6 ) 0.9 1 ] R 1/0.91/0.91/0.91/0.91/0.51/0.7
[ ( y 6 ) 0.8 0.5 ] R 0.5/0.90.5/0.90.5/0.90.5/0.90.5/0.50.5/0.7
[ ( y 7 ) 0.2 1 ] R 1/0.81/0.81/0.81/0.81/0.81/0.8
[ ( y 7 ) 0.1 1 ] R 1/0.91/0.91/0.91/0.91/0.91/0.9
Table 7. The upper approximations R ̲ ( A ˜ β ) .
Table 7. The upper approximations R ̲ ( A ˜ β ) .
R ̲ ( A ˜ β ) x 1 x 2 x 3 x 4 x 5 x 6
R ¯ ( A ˜ 1 ) 1/0.61/0.51/0.51/0.31/0.51/0.7
R ¯ ( A ˜ 2 ) 0.8/0.60.8/0.60.8/0.60.8/0.30.8/0.50.8/0.7
R ¯ ( A ˜ 3 ) 0.5/0.60.5/0.50.5/0.50.5/0.30.5/0.50.5/0.7
R ¯ ( A ˜ 4 ) 1/0.61/0.51/0.51/0.31/0.51/0.7
R ¯ ( A ˜ 5 ) 0.5/0.60.5/0.50.5/0.50.5/0.30.5/0.50.5/0.7
R ¯ ( A ˜ 6 ) 0.8/0.60.8/0.60.8/0.60.8/0.30.8/0.50.8/0.7
R ¯ ( A ˜ 7 ) 0.5/0.60.5/0.60.5/0.60.5/0.30.5/0.50.5/0.7
R ¯ ( A ˜ 8 ) 0.5/0.60.5/0.60.5/0.60.5/0.30.5/0.50.5/0.7
Table 8. The lower approximation R ̲ ( A ˜ ) .
Table 8. The lower approximation R ̲ ( A ˜ ) .
x 1 x 2 x 3 x 4 x 5 x 6
R ̲ ( A ˜ ) ( x i ) 1/0.61/0.5 + 0.8/0.61/0.5 + 0.8/0.61/0.31/0.51/0.7
C ( R ̲ ( A ˜ ) ( x i ) ) 0.60.540.540.30.50.7
Table 9. Sum of lower approximation and upper approximation R ̲ ( A ˜ ) + R ¯ ( A ˜ ) .
Table 9. Sum of lower approximation and upper approximation R ̲ ( A ˜ ) + R ¯ ( A ˜ ) .
x 1 x 2 x 3 x 4 x 5 x 6
[ R ̲ ( A ˜ ) + R ¯ ( A ˜ ) ] ( x i ) 1/0.5 + 1/0.61/0.5 + 0.8/0.61/0.5 + 1/0.61/0.3 + 1/0.41/0.51/0.5 + 1/0.7
C ( [ R ̲ ( A ˜ ) + R ¯ ( A ˜ ) ] ( x i ) ) 0.550.540.550.350.50.6
Table 10. Granular type-2 fuzzy sets [ ( y j ) B β ( y j ) B β * ( y j ) ] R .
Table 10. Granular type-2 fuzzy sets [ ( y j ) B β ( y j ) B β * ( y j ) ] R .
[ ( y j ) B β ( y j ) B β * ( y j ) ] R x 1 x 2 x 3 x 4 x 5 x 6
[ ( y 1 ) 0.7 0.6 ] R 0.6/0.30.6/0.30.6/0.40.6/0.70.6/0.20.6/0.3
[ ( y 1 ) 0.8 1 ] R 1/0.31/0.31/0.41/0.71/0.21/0.3
[ ( y 2 ) 0.2 1 ] R 1/0.11/0.21/0.21/0.21/0.21/0.2
[ ( y 2 ) 0.3 1 ] R 1/0.11/0.31/0.31/0.31/0.31/0.3
[ ( y 3 ) 0.5 1 ] R 1/0.41/0.51/0.51/0.21/0.21/0.2
[ ( y 4 ) 0.7 1 ] R 1/0.41/0.11/0.11/0.11/0.31/0.2
[ ( y 5 ) 0.4 1 ] R 1/0.11/0.31/0.31/0.21/0.41/0.2
[ ( y 6 ) 0.6 0.5 ] R 0.5/0.10.5/0.10.5/0.10.5/0.10.5/0.50.5/0.3
[ ( y 6 ) 0.9 1 ] R 1/0.11/0.11/0.11/0.11/0.51/0.3
[ ( y 7 ) 0.1 1 ] R 1/0.11/0.11/0.11/0.11/0.11/0.1
Table 11. The upper approximations R ¯ ( B ˜ β ) .
Table 11. The upper approximations R ¯ ( B ˜ β ) .
R ¯ ( B ˜ β ) x 1 x 2 x 3 x 4 x 5 x 6
R ¯ ( B ˜ 1 ) 0.5/0.40.5/0.50.5/0.50.5/0.70.5/0.50.5/0.3
R ¯ ( B ˜ 2 ) 0.5/0.40.5/0.50.5/0.50.5/0.70.5/0.50.5/0.3
R ¯ ( B ˜ 3 ) 0.5/0.40.5/0.50.5/0.50.5/0.70.5/0.50.5/0.3
R ¯ ( B ˜ 4 ) 0.6/0.40.6/0.50.6/0.50.6/0.70.6/0.50.6/0.3
R ¯ ( B ˜ 5 ) 0.6/0.40.6/0.50.6/0.50.6/0.70.6/0.50.6/0.3
R ¯ ( B ˜ 6 ) 1/0.41/0.51/0.51/0.71/0.51/0.3
R ¯ ( B ˜ 7 ) 0.5/0.40.5/0.50.5/0.50.5/0.70.5/0.50.5/0.3
R ¯ ( B ˜ 8 ) 1/0.41/0.51/0.51/0.71/0.51/0.3
Table 12. The upper approximation R ¯ ( B ˜ ) .
Table 12. The upper approximation R ¯ ( B ˜ ) .
x 1 x 2 x 3 x 4 x 5 x 6
R ¯ ( B ˜ ) ( x i ) 1/0.41/0.51/0.51/0.71/0.51/0.3
C ( R ¯ ( B ˜ ) ( x i ) ) 0.40.50.50.70.50.3
Table 13. Granular type-2 fuzzy sets [ ( y j ) B β c ( y j ) B β * ( y j ) ] R .
Table 13. Granular type-2 fuzzy sets [ ( y j ) B β c ( y j ) B β * ( y j ) ] R .
[ ( y j ) B β c ( y j ) B β * ( y j ) ] R x 1 x 2 x 3 x 4 x 5 x 6
[ ( y 1 ) 0.3 0.6 ] R 0.6/0.70.6/0.70.6/0.70.6/0.70.6/0.80.6/0.7
[ ( y 1 ) 0.2 1 ] R 1/0.81/0.81/0.81/0.81/0.81/0.8
[ ( y 2 ) 0.8 1 ] R 1/0.91/0.71/0.71/0.61/0.51/0.5
[ ( y 2 ) 0.7 1 ] R 1/0.91/0.71/0.71/0.61/0.51/0.5
[ ( y 3 ) 0.5 1 ] R 1/0.61/0.51/0.51/0.81/0.81/0.8
[ ( y 4 ) 0.3 1 ] R 1/0.71/0.91/0.91/0.91/0.71/0.8
[ ( y 5 ) 0.6 1 ] R 1/0.91/0.71/0.71/0.81/0.51/0.8
[ ( y 6 ) 0.4 0.5 ] R 0.5/0.90.5/0.90.5/0.90.5/0.90.5/0.60.5/0.7
[ ( y 6 ) 0.1 1 ] R 1/0.91/0.91/0.91/0.91/0.91/0.9
[ ( y 7 ) 0.9 1 ] R 1/0.51/0.51/0.41/0.71/0.61/0.7
Table 14. The upper approximations R ̲ ( B ˜ β ) .
Table 14. The upper approximations R ̲ ( B ˜ β ) .
R ̲ ( B ˜ β ) x 1 x 2 x 3 x 4 x 5 x 6
R ¯ ( B ˜ 1 ) 0.5/0.50.5/0.50.5/0.40.5/0.60.5/0.50.5/0.5
R ¯ ( B ˜ 2 ) 0.5/0.50.5/0.50.5/0.40.5/0.60.5/0.50.5/0.5
R ¯ ( B ˜ 3 ) 0.5/0.50.5/0.50.5/0.40.5/0.60.5/0.50.5/0.5
R ¯ ( B ˜ 4 ) 0.6/0.50.6/0.50.6/0.40.6/0.60.6/0.50.6/0.5
R ¯ ( B ˜ 5 ) 0.6/0.50.6/0.50.6/0.40.6/0.60.6/0.50.6/0.5
R ¯ ( B ˜ 6 ) 1/0.51/0.51/0.41/0.61/0.51/0.5
R ¯ ( B ˜ 7 ) 0.5/0.50.5/0.50.5/0.40.5/0.60.5/0.50.5/0.5
R ¯ ( B ˜ 8 ) 1/0.51/0.51/0.41/0.61/0.51/0.5
Table 15. The lower approximation R ̲ ( B ˜ ) .
Table 15. The lower approximation R ̲ ( B ˜ ) .
x 1 x 2 x 3 x 4 x 5 x 6
R ̲ ( B ˜ ) ( x i ) 1/0.51/0.51/0.41/0.61/0.51/0.5
C ( R ̲ ( B ˜ ) ( x i ) ) 0.50.50.40.60.50.5
Table 16. Sum of lower approximation and upper approximation R ̲ ( B ˜ ) + R ¯ ( B ˜ ) .
Table 16. Sum of lower approximation and upper approximation R ̲ ( B ˜ ) + R ¯ ( B ˜ ) .
x 1 x 2 x 3 x 4 x 5 x 6
[ R ̲ ( B ˜ ) + R ¯ ( B ˜ ) ] ( x i ) 1/0.4 + 1/0.51/0.51/0.4 + 1/0.51/0.6 + 1/0.71/0.51/0.3 + 1/0.5
C ( [ R ̲ ( B ˜ ) + R ¯ ( B ˜ ) ] ( x i ) ) 0.450.50.450.650.50.4

Share and Cite

MDPI and ACS Style

Lu, J.; Li, D.-Y.; Zhai, Y.-H.; Bai, H.-X. Granular Structure of Type-2 Fuzzy Rough Sets over Two Universes. Symmetry 2017, 9, 284. https://doi.org/10.3390/sym9110284

AMA Style

Lu J, Li D-Y, Zhai Y-H, Bai H-X. Granular Structure of Type-2 Fuzzy Rough Sets over Two Universes. Symmetry. 2017; 9(11):284. https://doi.org/10.3390/sym9110284

Chicago/Turabian Style

Lu, Juan, De-Yu Li, Yan-Hui Zhai, and He-Xiang Bai. 2017. "Granular Structure of Type-2 Fuzzy Rough Sets over Two Universes" Symmetry 9, no. 11: 284. https://doi.org/10.3390/sym9110284

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