This paper constructs ℒ-covering fuzzy variable precision rough set and mainly studies some properties of type I and type II ℒ-covering fuzzy lower and upper approximation operators of ℒ-fuzzy sets on X. Topology properties of type I and type II ℒ-covering fuzzy lower and upper approximation operators are also discussed through a fuzzy interior operator and fuzzy closure operator. Moreover, we investigate the dual properties and compare between ℒ-covering fuzzy variable precision rough approximation operators.
Rough set theory was introduced by Pawlak [13] in 1982 as a mathematical approach to handle imprecision, vagueness and uncertainty in data analysis. In rough set theory, the lower and upper approximation operators are examined by many authors, which showed many interesting results and properties. Up to now, the concept of rough set had been used as a tool to model and process insufficient and incomplete information. A problem with Pawlak’s rough set theory is that an equivalence relation is explicitly used in the definition of the lower and upper approximations. However, it has been applied only in complete information systems that may limit the applications of the rough set model. Thus one of the main directions of research in rough set theory is naturally the generalization of the Pawlak rough set approximations.
To develop rough set theory, in 1990, Dubois and Prade [3, 4] put rough sets and fuzzy sets [18] together by using the triangular t-norm Min and its dual t-conorm Max, and gave out definition the pair of fuzzy rough set approximation operators with respect to a Pawlak approximation space and a fuzzy similarity relation to obtain the extended notions called rough fuzzy sets and fuzzy rough sets, respectively. In 2004, ℒ-fuzzy rough set (ℒ-FRS) was first developed by Radzikowska and Kerre [15], as a generalization of the notion of rough sets determined by a residuated lattice ℒ [6, 14]; Estaji et al. [5] also studied a connection between rough sets and lattice theory. They generalized rough set theory to residuated lattice serving as a more general structure of truth values. In 2009, She [16] extended to the axiomatic characterization of various ℒ-FRSs. Many authors have studied topological structures, such as, Ma and Hu [12] studied the relationship between ℒ-fuzzy rough approximation operators and ℒ-fuzzy topological spaces by the lower set and upper set, Wang and Hu [17] presented fuzzy rough sets based on generalized residuated lattices. Zhao and Hu supposed fuzzy variable precision rough sets based on residuated lattices [22].
Besides, another way of extension of ordinary rough set theory is rough set based on covering. Bonikowski et al. [1] proposed covering rough set as one of extension of the concept of ordinary rough set, in which covering-based rough set was derived by replacing the partitions of a universe with its coverings. The overviews on rough sets based on covering were given in [21, 23–26]. In 2007, Deng et al. [2] investigated fuzzy rough set based on a fuzzy covering. In 2009, Li et al. [11] developed to generalized fuzzy rough approximation operators based on a fuzzy covering, and in 2012, Zhang et al. [19] extended to generalized intuitionistic fuzzy rough sets based on intuitionistic fuzzy coverings.
Variable precision rough set (VPRS) is one of the most important generalizations of Pawlak rough set (RS), which was introduced by Ziarko in 1993 [27]. It allows partial belongingness of a set to another. Zhao et al. [20] integrated the idea of variable precision into FRSs, constructed a model of fuzzy variable precision rough sets (FVPRSs) by combining the fuzzy rough sets and variable precision rough sets, which is non-sensitive to the perturbation of the original numerical data. Recently, Hu and Wong [7, 8] studied generalized interval-valued fuzzy rough sets based on logical operators and generalized interval-valued fuzzy variable precision rough sets based on fuzzy logical operators.
This paper aims to combine the idea of variable precision rough set with ℒ-covering fuzzy rough approximation operators to obtain ℒ-covering fuzzy variable precision rough approximation operators. In what follows, we will first summarise several basic concepts and introduce some notations for convenience. Based on this, we will present ℒ-covering fuzzy variable precision rough sets to discusses some of new properties of type I/type II ℒ-covering fuzzy variable precision rough approximation operators. We will then produce ℒ-covering fuzzy variable precision rough approximation operators, investigate properties of the generalized fuzzy variable precision rough approximation operators and topology properties of type I ℒ-covering fuzzy variable precision rough approximation operators, duality of the generalized fuzzy rough approximation operators. Finally, we will discuss difference of fuzzy rough approximation operators.
Preliminaries
Rough set
In traditional Pawlak’s rough set theory, the pair (X, R) is called an approximation space, where X is a universe and R is an equivalence relation on X, i.e., R is reflexive, symmetrical and transitive. The relation R decomposes the set X into a disjoint class in such a way that two elements x and y are in the same class iff (x, y) ∈ R.
Suppose R to be an equivalence relation on X. With respect to R, we can define an equivalence class of an element x in X as follows: [x] R = {y ∣ (x, y) ∈ R}.
The quotient set of U by the relation R is denoted by X/R, and
where Ui (i = 1, 2, . . . , m) is an equivalence class of R. Elements in the same equivalence class are said to be indistinguishable, and the equivalence classes of R are called elementary sets. Every union of elementary sets is called a definable set. In particular, the empty set is also considered to be a definable set.
Given an arbitrary set U ⊆ X, it may not be possible to describe U precisely in the approximation space (X, R), the pair of lower and upper approximations of U with respect to R defined as follows
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 a 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.
Lemma 2.1.Let (L, ∨ , ∧ , ⊗ , → , 0, 1) be a complete residuated lattice. Then the following holds: for all a, b, c, ai, bi ∈ L (i ∈ Λ),
a ≤ b ⇔ a → b = 1;
a → a = a → 1 =0 → a = 1, 1 → a = a;
b1 ≤ b2 ⇒ a ⊗ b1 ≤ a ⊗ b2;
b1 ≤ b2 ⇒ a → b1 ≤ a → b2, b2 → a ≤ b1 → a;
∨i∈Λai → b = ∧ i∈Λ (ai → b), ∧i∈Λai → b ≥ ∨ i∈Λ (ai → b);
b → ∧ i∈Λai = ∧ i∈Λ (b → ai), b → ∨ i∈Λai ≥ ∨ i∈Λ (b → ai);
b ⊗ (∨ i∈Λai) = ∨ i∈Λ (b ⊗ ai), b ⊗ (∧ i∈Λai) ≤ ∧ i∈Λ (b ⊗ ai);
¬ {∨ iai} = ∧ i ¬ ai, ¬ {∧ iai} ≥ ∨ i ¬ ai;
a → (b → c) = (a ⊗ b) → c = b → (a → c);
a ⊗ (b ∨ c) ≤ b ∨ (a ⊗ c), a ∧ (b → c) ≤ b → (a ∧ c).
The next, we will review the several typical definitions and properties of residuated lattice, fuzzy topology and fuzzy topology operators and ℒ-fuzzy variable precision rough sets. First, let us we will summarise basic definitions of classical residuated lattice.
ℒ-fuzzy sets, ℒ-relations and ℒ-topologies
The concept of ℒ-fuzzy set was first introduced by [6] when ℒ is a complete residuated lattice. And ℒ-fuzzy set was considered as a generalization of the notion of Zadeh’s fuzzy sets [18]. In what follows, specific definitions of ℒ-fuzzy sets are outlined.
Definition 2.2. Let ℒ be a complete lattice and let U be a nonempty set called the universe of discourse. A mapping is called an ℒ-fuzzy set in U.
Denote by the family of all ℒ-fuzzy sets on X. An ℒ-fuzzy set μ is constant if μ (x) = a, for all x ∈ X, written as . An ℒ-fuzzy set μ is denoted by αY, if ∅ ≠ Y ⊆ X and
If Y = {y}, then αY is denoted by αy.
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) θ 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 be a relation fuzzy on X. Then θ is
serial if ∨y∈Xθ (x, y) =1, ∀x ∈ X;
reflexive if θ (x, x) =1, ∀x ∈ X;
symmetric if θ (x, y) = θ (y, x), ∀x, y ∈ X;
transitive if θ (x, y) ⊗ θ (y, z) ≤ θ (x, z), ∀x, y, z ∈ X;
Lemma 2.3.[2] If is a reflexive and transitive fuzzy relation, then
Definition 2.4. [2] A fuzzy covering of X is a collection of fuzzy sets satisfying
every fuzzy set μ ∈ Φ is non-null, i.e., μ≠ ∅.
∀x ∈ X, ∨ μ∈Φμ (x) >0.
Given a fuzzy relation and let [x] θ (y) = θ (x, y).
Fuzzy topology and fuzzy topology operators
Definition 2.5. is a fuzzy topology on X if it satisfies the following conditions:
0, 1 ∈ χ,
μ ∩ ν ∈ χ for any μ, ν ∈ χ,
∪i∈Iμi ∈ χ for any μi ∈ χ, i ∈ I.
Definition 2.6. [12] An operator is a fuzzy interior operator if it satisfies the conditions (I1)-(I4), ,
ψ (1) =1,
ψ (μ) ⊆ μ,
ψ (ψ (μ)) = ψ (μ),
ψ (μ ∩ ν) = ψ (μ) ∩ ψ (ν).
An operator is a fuzzy closure operator if it satisfies the conditions (C1)-(C4), ,
ω (0) =0,
μ ⊆ ω (μ),
ω (ω (μ)) = ω (μ),
ω (μ ∪ ν) = ω (μ) ∪ ω (ν).
ℒ-fuzzy variable precision rough sets
Let X be a nonempty universe of discourse and θ be an ℒ-fuzzy relation on X. The pair (X, θ) is called an ℒ-fuzzy approximation space.
Definition 2.7. [22] Let (X, θ) be an ℒ-fuzzy approximation space and α ∈ L. Define the following two mappings , called ℒ-fuzzy variable precision lower and upper approximation operators, respectively, as follows: for all x ∈ X and ,
is called an ℒ-fuzzy variable precision rough set (ℒ-FVPRS) with respect to μ.
In the following, let X be a nonempty universe of discourse and Φ be a fuzzy covering of X. The pair (X, Φ) is called an ℒ-covering fuzzy approximation space. For an arbitrary fuzzy relation θ derived from Φ, (X, θ) is also called an ℒ-covering fuzzy approximation space.
ℒ-covering fuzzy rough sets
Li [10] proposed the concept of fuzzy approximation operators based on coverings by two operators t-norm ∧ and t-conorm ∨. Deng [2] investigated fuzzy rough sets based on a fuzzy covering in the framework of residuated lattice, but they only gave type I ℒ-covering fuzzy rough set on U. Li [11] fully studied two types ℒ-covering fuzzy rough set on U by two operators t-norm and the residual implicator (R-implicator) based on t-norm .
Let ℒ be a complete residuated lattice. We present definitions of two types ℒ-covering fuzzy rough approximation operators on X.
Definition 2.8. [2, 11] Let (X, Φ) be an ℒ-covering fuzzy approximation space. Two pairs of approximation operators are defined as follows, for all x ∈ X and ,
The pair is called type I ℒ-covering fuzzy rough set of μ on X and is called type II ℒ-covering fuzzy rough set of μ on X. The on and are called the type I and type II ℒ-covering fuzzy lower and upper approximation operators on X.
In this subsection, we introduce new definition of ℒ-covering fuzzy variable precision rough approximation operators based on reduated lattice.
Definition 3.1. Let (X, Φ) be an ℒ-covering fuzzy approximation space. Two pairs of approximation operators are defined as follows, for all x ∈ X and ,
The pair is called an α-type I ℒ-covering fuzzy rough set of μ on X and is called α-type II ℒ-covering fuzzy rough set of μ on X. The and are called the α-type I and α-type II fuzzy variable precision lower and upper approximation operators on X, respectively.
Note 3.2. When α = 0, α-type I/α-type II ℒ-covering fuzzy variable precision lower and upper approximation operators in Definition 3.1 are degenerated into type I/type II ℒ-covering fuzzy lower and upper approximation operators in Definition 2.8, respectively.
Example 3.3. Consider the bounded lattice {0, a, b, c, 1} with the partial order ≤ defined by 0 < a < b < c < 1, in which a = ¬ c. ⊗ is defined and → is computed, respectively, as follows:
Let X = {x1, x2} and the ℒ-relations be defined as follows:
, and α = b.
So, and .
and .
Proposition 3.4.Let (X, Φ) be an ℒ-covering fuzzy approximation space. Then, for any 0 ≤ α ≤ β ≤ 1, , we have the following statements.
, .
, .
, .
, .
Proof. It is easy to prove Theorem 3.4 by Lemma 2.1 and Definition 3.1. □
Proposition 3.5.Let (X, Φ) be an ℒ-covering fuzzy approximation space. If ϑ ⊆ θ, then, , the following statements hold.
, .
, .
Proof. It is easy to prove Theorem 3.5 by Lemma 2.1 and Definition 3.1. □
Properties of α-type I ℒ-covering fuzzy variable precision rough approximation operators
Proposition 3.6.Let (X, Φ) be an ℒ-covering fuzzy approximation space. Then we have: for all α, β ∈ L and (i ∈ Λ),
μ ⊆ ν implies , .
, .
, .
, ;
If θ1 ⊆ θ2, then and .
, .
, .
Proof. It is easy to prove 3.6(1)-3.6(7) by Lemma 2.1 and Definition 3.1.
(8) For all ,
And,
So, . By applying 3.6(7), we have . □
In general, and may not satisfy the following properties.
In the next subsection we will find the conditions under which satisfies (1) and satisfies (2). Besides, we consider relation between topology structure of α-type I ℒ-covering fuzzy variable precision rough approximation operators and fuzzy interior/closure operator.
Topology structure of α-type I ℒ-covering fuzzy variable precision rough approximation operators
Definition 3.7. Let (X, Φ) be an ℒ-covering fuzzy approximation space. We define
.
.
Theorem 3.8.Let (X, Φ) be an -covering fuzzy approximation space. For any , then the following hold.
.
For all i, , .
implies .
Proof.
Obviously, .
, we have . So, , i.e., .
It follows immediately from Theorem 3.6(8).
□
Remark 3.9. is not closed under finite intersection of sets.
Theorem 3.10.Let (X, Φ) be an ℒ-covering fuzzy approximation space. For any , then the following hold.
.
For all i, , .
implies .
, iff .
Proof.
Obviously, .
, we have . So, , i.e., .
It follows immediately from Theorem 3.6(8).
It can be proven by the duality of ⊗ and → w.r.t to ¬. □
Remark 3.11. is not closed under finite union of sets.
Theorem 3.12.Let (X, Φ) be an -covering fuzzy approximation space. For and , then the following hold.
satisfies if and only if the family is a fuzzy topology on X.
satisfies if and only if the family is a fuzzy topology on X.
Proof.
(⇒) For all , , so . By combining with Theorem 3.10(1)(2), we obtain is a fuzzy topology on X.
((⇐) Let be a fuzzy topology on X. For any , by Theorem 3.6(3), we have . Applying Theorem 3.6(7), . Again, by Theorem 3.6(7), . On the other hand, is a fuzzy topology, we have , so . Then, . Thus, we can conclude .
It can be proved in a similar way of item (1).
□
Theorem 3.13.Let (X, Φ) be an ℒ-covering fuzzy approximation space. Then the following hold.
Operator is a fuzzy interior operator if and only if the family is a fuzzy topology on X.
Operator is a fuzzy closure operator if and only if the family is a fuzzy topology on X.
Proof. It can be proved by Theorem 3.12 and Definition 2.6. □
Theorem 3.14.Let (X, Φ) be an ℒ-covering fuzzy approximation space and X be a finite partially ordered set. Then the following hold.
is a fuzzy topology on X if only if is a lattice on X.
is a fuzzy topology on X if and only if is a lattice on X.
Proof. It follows immediately from Theorems 3.8, 3.10 and 3.12. □
Theorem 3.15.Let (X, Φ) be an ℒ-covering fuzzy approximation space and X be a finite partially ordered set. If and are fuzzy topology on X, then is dually isomorphic to .
Proof. Let be a mapping such that , and f be definable on Theorem 3.10. Then f is bijective. For , and . □
Theorem 3.16.Let (X, Φ) be an ℒ-covering fuzzy approximation space. For any ,
,
.
Proof., . Thus, . Meanwhile, by Theorem 3.6(7)(8), we have . So . Thus, . □
Properties of α-type II ℒ-covering fuzzy variable precision rough approximation operators
Let (X, Φ) be an ℒ-covering fuzzy approximation space. We can define a fuzzy tolerance relation (i.e., it satisfies reflexive and symmetric) on X: θΦ (x, z) = ∨ y∈X (θ (x, y) ⊗ θ (z, y)) , ∀ x, y, z ∈ X.
Theorem 3.17.Let (X, Φ) be an ℒ-covering fuzzy approximation space. Then, we have , .
Proof. For all and α ∈ L,
Hence, .
The others can be proved similarly. □
Lemma 3.18.[22] Let (X, θ) be an ℒ-fuzzy approximation space. Then, we have the following statements.
, .
, .
, .
, , .
.
, .
Lemma 3.19.[22] Let (X, θ) be an ℒ-fuzzy approxi- mation space. Then the following statements are equivalent.
θ is symmetric.
.
.
Lemma 3.20.[22] Let (X, θ) be an ℒ-fuzzy approximation space. Then the following statements are equivalent.
θ is reflexive.
.
.
Theorem 3.21.Let (X, Φ) be an ℒ-covering fuzzy approximation space. The operators and satisfy the following properties:
and .
For any a ∈ L, .
For any , , .
.
For any , .
For any , , .
For any , .
For any , and .
Proof. By Theorem 3.18, Lemmas 3.19 and 3.20, it can immediately prove Theorem 3.21(1)–(6).
We only prove the first inclusion relation in item (8).
For any , we have
Duality of the ℒ-covering fuzzy rough approximation operators
The duality between rough approximation operators is an important property in rough set theory and fuzzy rough set theory.
Theorem 3.22.Let (X, Φ) be an ℒ-covering fuzzy approximation space. Suppose that ℒ is a complete regular residuated lattice, then, for all , we have
and .
.
.
Proof. If ℒ is a complete regular residuated lattice, then the theorem can be easily proved by property ¬¬ a = a. □
Theorem 3.23.Let (X, Φ) be an ℒ-covering fuzzy approximation space. Then, for all , we have
and .
and .
Proof. If ℒ is a complete residuated lattice, then the theorem can be easily proved by property a ≤ ¬¬ a. □
Comparison of ℒ-covering fuzzy variable precision rough approximation operators
Theorem 4.1.Let (X, Φ) be an ℒ-covering fuzzy approximation space. If θ is a reflexive, then for all , we have
,
.
Proof. For all , we have
And,
Thus, for , we have . By applying Proposition 3.6(7), we can conclude that . □
Corollary 4.2.If θ is a reflexive and transitive fuzzy relation on X, then and .
Proof. For all , we have
So, , it follows from Theorem 4.1 that . □
Theorem 4.3.If θ is a symmetric fuzzy relation on X, then for any and x ∈ X,
and .
and .
Proof. Let x ∈ X. Then for each y ∈ X, y ∈ Cx, θ (x, y) =1.
Conclusion
This paper mainly proposes two types of ℒ-covering fuzzy variable precision rough approximation operators, α-type I and α-type II ℒ-covering fuzzy variable precision rough set. Some basic properties of the new approximation operators are discussed. Besides, we also construct topology structure of ℒ-covering fuzzy variable precision rough approximation operators and consider their relationship and fuzzy topology operators. The duality and comparison between α-type I and α-type II ℒ-covering fuzzy variable precision rough set under certain conditions were also studied in this paper.
Footnotes
Acknowledgments
This research was supported by the National Nature Science Foundation of China (Grand No. 61179038).
References
1.
BonikowskiZ., BryniarskiE. and WybraniecU., Extensions and intentions in the rough set theory, Information Sciences107 (1998), 149–167.
2.
DengT.Q., ChenY.M., XuW.L. and DaiQ.H., A novel approach to fuzzy rough sets based on a fuzzy covering, Information Sciences177 (2007), 2308–2326.
3.
DuboisD. and PradeH., Rough fuzzy sets and fuzzy rough sets, International Journal of General System17(2) (1990), 191–209.
4.
DuboisD. and PradeH., Putting rough sets and fuzzy sets together, Intelligent Decision Support, SpringerNetherlands, 1992.
5.
EstajiA.A., HooshmandaslM.R. and DavvazB., Rough set theory applied to lattice theory, Information Sciences200 (2012), 108–122.
6.
GoguenJ.A., ℒ-fuzzy set, Journal of Mathematical Analysis and Applications18 (1967), 145–174.
7.
HuB.Q. and WongH., Generalized interval-valued fuzzy variable precision rough sets, International Journal of Fuzzy Systems16 (2014), 554–565.
8.
HuB.Q. and WongH., Generalized interval-valued fuzzy rough sets based on interval-valued fuzzy logical operators, International Journal Fuzzy System15(4) (2013), 381–391.
9.
KazanciO. and DavvazB., More on fuzzy lattices, Computer and Mathematics with Applications64(9) (2012), 2917–2925.
10.
LiT.J. and MaJ.M., Fuzzy approximation operators based on coverings, Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, SpringerBerlin Heidelberg, 2007, pp. 55–62.
11.
LiT.J., LeungY. and ZhangW.X., Generalized fuzzy rough approximation operators based on a fuzzy covering, International Journal Approximate Reasoning48 (2008), 836–856.
12.
MaZ.M. and HuB.Q., Topological and lattice structures of ℒ-fuzzy rough sets determined by lower and upper sets, Information Sciences218 (2013), 94–204.
13.
PawlakZ., Rough set, International Journal of Computer Information Science11(5) (1982), 341–356.
14.
RasouliS. and DavvazB., An investigation on algebraic structure of soft sets and soft filters over residuated lattices, ISRN Algebra2014 (2014), Article ID 635783, 8 pages.
15.
RadzikowskaA.M., Fuzzy rough sets based on residuated lattices, Transactions on Rough Sets II, LNC3135 (2004), 278–296.
16.
SheY.H. and WangG.J., An axiomatic approach of fuzzy rough sets based on residuated lattices, Computers and Mathematics with Applications58(1) (2009), 189–201.
17.
WangC.Y. and HuB.Q., Fuzzy rough sets based on generalized residuated lattices, Information Sciences248(1) (2013), 31–49.
18.
ZadehL.A., Fuzzy sets, Information and Control8 (1965), 338–358.
19.
ZhangZ.M., Generalized intuitionistic fuzzy rough sets based on intuitionistic fuzzy coverings, Information Sciences198 (2012), 186–206.
20.
ZhaoS., TsangE. and ChenD., The model of fuzzy variable precision rough sets, IEEE Transactions on Fuzzy Systems17(2) (2009), 451–467.
21.
ZhangY.L., LiJ.J. and WuW.Z., On axiomatic characterizations of three pairs of covering based approximation operators, Information Sciences180(2) (2010), 274–287.
22.
ZhaoX.R. and HuB.Q., Fuzzy variable precision rough sets based on residuated lattices, International Journal of General Systems44(7-8) (2015), 743–765.
23.
ZhuW., Topological approaches to covering rough sets, Information Sciences177(6) (2007), 1499–1508.
24.
ZhuW., Relationship between generalized rough sets based on binary relation and covering, Information Sciences179(3) (2009), 210–225.
25.
ZhuW. and WangF.Y., Reduction and axiomization of covering generalized rough sets, Information Sciences152 (2003), 217–230.
26.
ZhuW. and WangF.Y., On three types of covering-based rough sets, IEEE Transactions on Knowledge and Data Engineering19(8) (2007), 1131–1144.
27.
ZiarkoW., Variable precision rough set model, Journal of Computer and System Sciences46(1) (1993), 39–59.