Abstract
This paper studies -fuzzy multigranulation rough set based on residuted lattices, which is considered as an extension of the classical -fuzzy rough set. Two models of -fuzzy optimistic multigrannulation rough set and -fuzzy pessimistic multigrannulation rough set based on residuted latteices are suggested. Then, we mainly investigate some fundamental properties of the -fuzzy multigranulation rough set model. With regards to residuated lattices’ topology, we study the topological and the lattice structure in the -fuzzy optimistic multigranulation rough set model and -fuzzy pessimistic multigranulation rough set model, respectively.
Keywords
Introduction
Rough set theory was introduced by Pawlak [12, 13] to deal with insufficient and incomplete data, which is originally constructed from the basis of an indiscernibility relation (or an equivalence relation) or a partition of the universe. Using equivalence classes, an arbitrary subset can be approximated by two subsets, namely the lower approximation and the upper approximation. The lower approximation is the greatest definable set contained in the given set of objects, while the upper approximation is the smallest definable set contained the given set. Two approximation operators are basic notions in the development of rough set theory and one of main directions for the study of rough set theory is naturally the extensive definitions of rough approximation operators in various fields. Moreover, many authors have combined fuzzy set [26] and rough set to obtain fuzzy rough set or rough fuzzy set [3, 4], which is to handle fuzzy and quantitative data.
With respect to granular computing which is proposed in [27], an equivalence relation on the universe can be considered as a granulation, and a partition on the universe can be regarded as a granulation space, so it is named single granulation rough set model. In regard to the practical aspect, there are some problems of multiple information resources (give examples). Thus, it is necessary to have some restrictions for applying single granulation. There are practically some problems to apply the multiple information resources. Single granulation structure therefore limits some applications. To address this issue, Qian introduced concept of multigranulation rough set in [15] (MGRS), where the set approximations are defined by using multi equivalence relations on the universe. The multigranulation rough set model provides an effective approach to solve problems in the context of multi granulations. She and He [17] studied on the structure of the multigranulation rough set model. Yang et al. [25] discussed multigranulation rough set: from crisp to fuzzy case. Qian studied incomplete multigranulation rough set [14]. Xu et al. [24] proposed multigranulation fuzzy rough sets in a fuzzy tolerance approximation space and multigranulation fuzzy rough sets [23]. Feng [5] investigated variable precision multigranulation decision-theoretic fuzzy rough sets. Construction of multigranulation rough set was also proposed in [19, 29]. Besides, the reader can see multigranultion rough set in various fields, such as, evidence-theory-based numerical characterization [20], intuitionistic fuzzy sets [8] and multigranulation decision-theoretic rough sets in incomplete information systems [28].
Radzikowska and Kerrein are known as pioneers of -fuzzy rough set (-FRS) [16]. They generalized rough set theory to residuated lattice serving as a more general structure of truth values. She et al. [18] extended to the axiomatic characterization of various -FRSs later. Many authors have studied topological structure. For example, Ma et al. [11] employed the lower and upper set to study the relationship between -fuzzy rough approximation operators and -fuzzy topological spaces by the lower set and upper set. Zhao et al. [22] presented fuzzy variable precision rough sets based on generalized residuated lattices which is an extension of fuzzy rough set.
Despite the fact that MGRS theory is thought as a new direction in rough set, its connection to residuated lattice theory has not been mentioned in past studies. For this reason, the aim of this paper is to study properties of -fuzzy multigranulation rough set based on residuated lattices. To address this issue, we first examine the connection between MGRS and -fuzzy rough set based on residuated lattices and introduce definition of -fuzzy optimistic/pessimistic multigranulation rough set model based on residuated lattices. Then, we study some fundamental properties of the multigranulation rough set model. Particularly, we focus on the topological structure and the lattice structure in the -fuzzy optimistic multigranulation rough set model and -fuzzy pessimistic one by optimistic-lower/upper set and pessimistic-lower/upper set, respectively.
This paper is organized as follows. Some of concepts and properties of residuated lattices will be mentioned in Section 2. Section 3 states definitions about the -fuzzy optimistic/pessimistic multigranulation lower and upper approximation operators and their relating properties. Section 4 mainly presents the optimistic/pessimistic lower and upper sets to investigate the topological structure. The last one is conclusion.
Preliminaries
In this section, we firstly review definitions and properties of residuated lattice and -fuzzy rough set [11, 22].
Residuated lattice
A residuated lattice is an algebra (L, ∨ , ∧ , ⊗ , → , 0, 1), where (L, ∨ , ∧ , 0, 1) is a bounded lattice with the greatest element 1 and the smallest element 0; (L, ⊗ , 1) is a commutative monoid and (⊗ , →) is an adjoint pair on satisfying a ⊗ b ≤ c ⇔ a ≤ b → c, ∀a, b, c ∈ L.
Let a ∈ L and define an unary operator, as ¬a = a → 0, referred to as the precomplement operator. If for any a ∈ L, ¬¬ a = a, then is called a regular residuated lattice.
-sets, -relations and -topologies
Denote by the family of all -sets on X. An -set μ is constant if μ (x) = a, for all x ∈ X, written as . An -fuzzy set μ is denoted by α
Y
, if ∅ ≠ Y ∈ X and
The basic and most common operations on are as follows: for all x ∈ X and ,
We also write u ≤ v to denote u (x) ≤ v (x) for all x ∈ X.
An -fuzzy relation (take -relation for short) [6] θ is a binary function defined on X also with truth values from , i.e., θ : X × X → L. Likewise, denotes the family of all -fuzzy relations on X.
Let , ∀x, y, z ∈ X. Then θ is serial if ∨y∈Xθ (x, y) =1; reflexive if θ (x, x) =1; symmetric if θ (x, y) = θ (y, x); transitive if θ (x, y) ⊗ θ (y, z) ≤ θ (x, z); Euclidean if θ (z, x) ⊗ θ (z, y) ≤ θ (x, y).
θ is transitive ⇔ ∨y∈X (θ (x, y) ⊗ θ (y, z)) ≤ θ (x, z), ∀x, z ∈ X. θ is Euclidean ⇔ ∨z∈X (θ (z, x) ⊗ θ (z, y)) ≤ θ (x, y), ∀x, y ∈ X.
-fuzzy rough sets
is called an -fuzzy rough set (-FRS) with respect to μ.
-fuzzy optimistic multigranulation rough sets and -fuzzy pessimistic multigranulation rough sets
In this section, we propose two types -fuzzy multigranulation rough sets, -fuzzy optimistic multigranulation rough sets and -fuzzy pessimistic multigranulation rough sets, as an extionsion of –fuzzy rough set, and then investigate their basic properties and their characteristics properties in residuated lattices. Set θ ={ θ1, θ2, . . . , θ m } is called an -fuzzy multigranulation relations set on X if each θ i is an -fuzzy relation on X. Then we can write . An -fuzzy multigranulation relations set θ is called serial, reflexive, symmetric, transitive, Euclidean, -fuzzy preorder if and only if each θ i , with i = 1, 2, . . . , n, is serial, reflexive, symmetric, transitive, Euclidean, -fuzzy preorder, respectively.
In the following discussion, if not being specifically stated, is always a complete residuated lattice. (X, θ) is called an m dimensional -fuzzy multigranulation approximation space if X is a finite universe and θ is an -fuzzy multigranulation relations set on X.
Let (X, θ) and (X, ϑ) be two m dimensional -fuzzy multigranulation approximation spaces, in which , . Then we define θ ≤ ϑ if and only if .
The fuzzy set is called an -fuzzy optimistic multigranulation rough set (-FOMRS) with respect to μ and is called an -fuzzy pessimistic multigranulation rough set (-FPMRS).
Then, -FOMRS can be described as and and -FPMRS can be described as and .
, and .
With the Definition 3.1, we have
and .
and .
, . , , , . , , , . If θ ≤ ϑ, then , . , .
, . , . , . , . , . , , , . , , , .
(4) For all x, y ∈ X, we have
The other one can be similarly proved. (5) For all x, y ∈ X, by taking a = 1, it follows . It is similar to prove for the others. □
and . and . and .
, , ,
, , ,
, , ,
-fuzzy multigranulation relations set is serial. . . . .
-fuzzy multigranulation relations set is reflexive. . . . .
.
Hence, it holds that .
(1) ⇒ (3) can be proven by a similar way.
(2) ⇒ (1) For any x ∈ X, let μ = 1 x . As we know and at the same time, it follows that , i,e, θ i (x, x) =1.
The others can be proven in a similar way. □
-fuzzy multigranulation relations set is symmetric. . . . . . .
.
-fuzzy multigranulation relations set is symmetric. . . . .
As -fuzzy multigranulation relations set is symmetric, it follows that .
implies -fuzzy multigranulation relations set is symmetric. Assume that -fuzzy multigranulation relations set is not symmetric, then there exist x0, y0 ∈ X such that θ (x0, y0) ≠ θ (y0, x0). Consider the following three cases:
Assume that θ (x0, y0) ≤ θ (y0, x0), thenθ (y0, x0) ≰ θ (x0, y0) holds, so θ (y0, x0)→θ (x0, y0) <1. Let μ (y) = θ
i
(x0, y). Then . We obtain , which implies a contradiction. Assume that θ (y0, x0) ≤ θ (x0, y0) and μ (y) = θ (y0, y), then it can be proved in a similar way as Case 1 that does not hold. Assume that θ (y0, x0) and θ (x0, y0) are incomparable, then in a similar way as Case 1, we have does not hold. In accordance with the above methods, it be proved that an -fuzzy multigranulation relations set is symmetric ⇔ . The others can be proved in a similar way. □
-fuzzy multigranulation relations set is transitive. . . . .
(1) ⇒ (2) For all x ∈ X, we have i.e., . (2) ⇒ (1) For any x, y ∈ X, set μ = 1
y
, it then follows from the assertion in (2) that
Thus, -fuzzy multigranulation relations set is transitive. (1) ⇔ (3) can be proved in a similar way as item (1) and (2). The others can be proved in a similar way. □
-fuzzy multigranulation relations set is Euclidean. . . . .
i.e. .
(2) ⇒ (1) For the arbitrary x, y ∈ X, let μ = 1 y , then we have
Thus for all x, y, z ∈ X, we have θ i (x, z) → θ i (z, y) ≥ θ i (x, y) ⇔ θ i (x, z) ⊗ θ i (x, y) ≤ θ i (z, y). Consequently, θ is Euclidean.
The others can be proved in a similar way. □
, . , . , . , .
Höhle [7] described definition of subsethood as a the degree of μ. Let . Then the degree of μ being the subset of ν is μ ↦ ν = ∧ x∈X (μ (x) → ν (x)).
□
The topological structure of -fuzzy multigranulation rough sets
Lai et al. [10] presents the definition of lower sets and upper sets in fuzzy preorder sets and studies the relationship between fuzzy preordered set and fuzzy topologies. This notion can be seen in [1, 11]. In this paper, we investigate optimistic/pessimistic-lower and optimistic/pessimistic-upper sets and their topology structures in -fuzzy approximation spaces.
Optimistic/pessimistic-lower and optimistic/pessimistic-upper sets in -fuzzyapproximation spaces
μ is an optimistic-lower set ⇒ . μ is an optimistic-upper set ⇒ . μ is a pessimistic-lower set ⇔ . μ is a pessimistic-upper set ⇔ .
μ is an optimistic-upper set
⇔
⇔ ⇔
⇔ .
The another item can be proven in a similar way as (1). □
μ is an optimistic-lower set ⇒ . μ is an optimistic-upper set ⇒ . μ is a pessimistic-lower set ⇔ . μ is a pessimistic-upper set ⇔ .
-fuzzy multigranulation relations set is transitive ⇔ is an optimistic-lower set ⇔ is an optimistic-upper set. -fuzzy multigranulation relations set is transitive ⇔ is a pessimistic-lower set ⇔ is a pessimistic-upper set.
For all -fuzzy multigranulation relations set is transitive is an optimistic-lower set. The others can be proved similarly. □
-fuzzy multigranulation relations set is Euclidean ⇔ is an optimistic-lower set ⇔ is an optimistic-upper set. -fuzzy multigranulation relations set is Euclidean ⇔ is a pessimistic-lower set ⇔ is a pessimistic-upper set.
-topology generated by -relation
In this subsection, we consider that -fuzzy multigranulation relations set is reflexive.
, {μ
i
} i∈Λ ⊆ τ implies ∪i∈Λμ
i
∈ τ, μ, ν ∈ τ implies μ ∩ ν ∈ τ.
τ is an -topology, and μ ∈ τ implies α ⊗ μ ∈ τ, and μ ∈ τ implies α → μ ∈ τ.
τ is an -topology, .
,
,
.
μ is an optimistic-lower set . μ is an optimistic-upper set .
. For all i, , . If θ
i
∈ {θ1, . . . , θ
m
} then implies when -fuzzy multigranulation relations set is transitive.
It can be proved from Proposition 3.4 and that -fuzzy multigranulation relations set is reflexive. From Proposition 3.8(3), we have . When θ is a reflexive, we have . So . It can be proved from Corollary 3.15. □
We have
. For all i, , . , θ
i
∈ {θ1, . . . , θ
m
}, implies when -fuzzy multigranulation relations set is transitive. , iff when is a complete regular residuated lattice.
0, 1 ∈ H
O
. , θ
i
∈ {θ1, . . . , θ
m
}, it follows μ ∈ H
O
implies θ
i
(μ) ∈ H
O
when -fuzzy multigranulation relations set is transitive. , μ ∈ H
O
iff ¬μ ∈ H
O
when is a complete regular residuated lattice.
H
O
is not closed under finite intersection of sets. H
O
is not closed under finite union of sets.
. So ,i.e, ∨μ∈τμ ∈ τ.
Besides, it follows from Theorem 4.11. Then τ forms a topology. □
,
,
.
. implies . implies . if and only if . if and only if .
. .
It follows directly from Corollary 4.1.
From Theorem 4.2, we can conclude the following theorem.
forms an -topology U. It can be proved from Theorem 4.22. For all , by Theorem 4.23, μ is a pessimistic-upper set, i.e. for all x, y ∈ X, we have . And hence for all , ⇔ . Applying Theorem 4.23 again, we have . It follows immediately from Proposition 3.6(3). □
Conclusion
This paper focuses on research on some kinds of essential properties and topological structures on -fuzzy pessimistic multigranulation rough set model and -fuzzy optimistic multigranulation rough set model. Besides, we see that -fuzzy pessimistic multigranulation rough set model satisfies some kinds of properties in "Axiomatic characterizations of generalized -fuzzy rough approximation operators”, so we do not introduce it in this paper.
Acknowledgments
This research was supported by the National Nature Science Foundation of China (Grant Nos. 11571010, 61179038).
