Professional Documents
Culture Documents
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 94
Abstract—In rough set theory, the lower and upper approximation operators can be constructed via a variety of approaches.
Various generalizations of rough approximation operators have been made over the years. This paper presents a framework for
the study of rough sets and rough fuzzy sets on two universes of discourse. By means of a binary relation between two
universes of discourse, a class of revised rough sets and revised rough fuzzy sets based on two universes have been
proposed. Some properties of the new model are revealed. We believe that this model will be more natural in the sense that
rough sets (resp. rough fuzzy sets) are approximated by sets (resp. fuzzy sets) on the same universe. Moreover, some results,
examples and counter examples are provided.
Index Terms— approximation operator; generalized rough set; generalized rough fuzzy set; inverse serial relation; revised
rough set; revised rough fuzzy set; strong inverse serial relation.
—————————— ——————————
1 INTRODUCTIO
∗
∗ ∗
. ⊆ .
∗ ∗ ∗
∗
∈ | ⊆ , ∗
. ⊆ ∗
.
∈ | ⋂ ∅ . ∗
∗
. .
∗
∗
Proposition 3.1. Let , , be a revised (two-universe) ap- . ⊆ .
∗
∗ ∗
proximation space. Then for all , , ∈ , the approxi- . ⊆ .
∗
mation operators have the following properties: ∗
. ∗
⊆ ∗
.
∗
∗ ∗
∗ ∗
∗ . ⊆ .
. .
∗ ∗
. . The following example illustrates Remark 3.1.
∗ ∗ ∗ ∗
. ∩ ∩ .
∗
. ∗
∪ ⊇ ∗
∪ ∗
. Example 3.1. Let , , , , , , ,
∗
. ⊆ ⟹ ∗
⊆ ∗
. , , , , , and ∈ be a binary relation
∗ ∗ defined as:
. ⊆ ∗ ∗
.
∗
∗ ∗
. .
∗
∗
. ∅ ∅.
∗ ∗ ∗ 1 0 1 1 0 0
∗
. ∪ ∪ .
∗
∗ ∗ ∗ 0 0 1 1 1 0
. ∩ ⊆ ∩ .
∗
∗ ∗ 1 0 0 1 1 1
. ⊆ ⟹ ⊆ .
∗
∗ ∗ ∗ 0 0 1 1 0 0
. ⊆ .
1 0 1 1 1 0
∗
proof. ∗
. ∈ ∶ ⋂ ∅ 1 0 1 1 0 0
∈ ∶ ⋂ ∅ 1 0 0 1 1 0
∈ ∶ ⊆
∗ ∗
. Hence we have ∗
∅ ∅ and
, , , , , i.e., ∗ and ∗ do not hold. ∗
If
∗
. As is the universe set, hence ∗ ⊆ . Conversely, , , , then ∗ ∗ , , ,
∀ ∈ , ⊆ , this implies that ∈ ∗ . Thus , , , ∗, ∗
, hence ∗
⊄ ,
∗ ∗
⊆ ∗ and so ∗ . ∗
⊄ , ∗
⊄ and ∗
⊄ ∗ ,
i.e., ∗ ,∗ ∗ , ∗ and ∗ do not hold. ∗
If , , ,
∗ ∗
. Let ∈ ∩ ⟺ ⊆ ∩ then ∗ , , ∗ and ∗
{ . Thus
∗ ∗
⟺ ⊆ ⊆ ⊄ , ⊄ ∗ and ⊄ ∗ .
⟺ ∈ ∗ ∈ ∗ Therefore ∗ , ∗ and ∗ do not hold.
⟺ ∈ ∗ ⋂ ∗ .
∗ ∗ ∗
Therefore ∩ ∩ . Proposition 3.2. Let , , be a revised (two-universe) ap-
proximation space and be an inverse serial relation. Then for
∗ ∗
. Let ∈ ∪ ∗ , hence ∈ ∗ ∈ all ∈ , the approximation operators have the following
∗
. So ⊆ ⊆ and thus ⊆ properties:
⋃ , then ∈ ∗ ⋃ . Therefore ∗
∪ ⊇
∗
∪ ∗ . ∗
. ∗
∅ ∅.
∗ ∗
∗
. Let ∈ ∗
, then ⊆ but ⊆ . So ⊆ . ⊆ .
∗
∗
, hence ∈ ∗
. Therefore ∗ ⊆ ∗
. . .
∗
∗
. ⊆ .
∗ ∗ ∗
. Let ∈ , then ⊆ . Let ∈ , then ∗
. ∗
⊆ .
⊆ ∀ ∈ and so ⊆ . Consequently,
∈ ∗ . Then ⊆ ∗ and hence ∈ ∗ ∗ .
Proof. By the duality of approximation operators, we only
∗ ∗ ∗ ∗ ∗ need to prove the properties ∗ , ∗ . and ∗
.
We can prove and as the same as ∗
. Since R is inverse serial, then by Lemma 3.2. y ∈ G y
and ∗ .
for all y ∈ V, thus there does not exist y ∈ V such that
G y ⊆ ∅ , hence ∗ ∅ ∅.
Remark 3.1. If R ∈ U V is a binary relation in a re-
vised (two-universe) approximation space U , V, R , then ∗ ∗
. Let ∈ , then ⊆ but ∈ , thus ∈
the following properties do not hold for all Y ∈ V : ∗
. Therefore ⊆ .
∗ ∗
. ∅ ∅. ∗ ∗ ∗ ∗
. The proof of comes from and .
∗ ∗
. ⊆ .
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 3, MARCH 2012, ISSN 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 97
Remark 3.2. If R ∈ U V is an inverse serial relation in from the approximation of fuzzy set in a crisp approxima-
a revised (two-universe) approximation space U , V, R , tion space. In this section , we will introduce another ge-
then the following properties do not hold for all Y ∈ neralization of rough fuzzy set based on the intersection
V : of right neighborhoods .
∗
∗
. ⊆ ∗
. Definition 4.1[26]. Let U and V be two finite non-empty
∗ ∗ universes of discourse and R ∈ U V a binary relation
∗ ∗
. ⊆ .
∗
∗
∗
from U to V. The ordered triple U, V, R is called a (two-
. ⊆ .
∗ universe) approximation space. For any fuzzy set
∗ ∗ ∗
. ⊆ . Y ∈ V , the lower and upper approximations of Y,
and , with respect to the approximation space are
The following example illustrates Remark 3.2. fuzzy sets of U whose membership functions, for each
x ∈ U, are defined, respectively, by
Example 3.2. Let , , , , , , ,
, , , , , and ∈ be a binary relation min | ∈
defined as max | ∈ ,
∗
5 REVISED GENERALIZED ROUGH FUZZY SETS min : ∈ 1. Thus min : ∈
1. Therefore ∗ .
In the above model for generalized rough fuzzy sets, ∗
. Since ∀ ∈
fuzzy subsets of the universe V are approximated by ∗
∩ min ∩ : ∈
fuzzy subsets of the other universe U. This seems very
min ∧ : ∈
unreasonable. Furthermore there exists no relation be-
min : ∈ ∧ min : ∈
tween the set and its lower and upper approximations. ∗
∧ ∗
However, the operators , , and are not de- ∗ ∗
∩ .
fined, so the properties ( and ( ∗ ∗ ∗
Therefore ∩ ∩ .
which are true in various generalized rough set models
do not hold in (two-universe) models. Thus a more natu- ∗
. Since ∀ ∈
ral form for rough sets on two universes is proposed such ∗
∪ min ∪ : ∈
that the approximations of subsets of the universe V are
min ∨ : ∈
subsets of the universe V.
min : ∈
∗
(1)
Definition 5.1. Let U, V, R be a revised (two-universe) ∗
Also ∪ min ∪ : ∈
approximation space. Then the revised lower and upper
min ∨ : ∈
approximations of Y ∈ V are defined respectively as
min : ∈
follows: ∗
(2)
∗ From (1) and (2) we get
min | ∈ ∗ ∗ ∗
∗ ∪ max ,
max | ∈ . ∗ ∗
∪ .
∗ ∗ ∗
∗
∗ Hence ∪ ⊇ ∪ .
The pair , is ∗ referred to as a revised
rough fuzzy set , and ∗ and : → are referred ∗
. Since ⊆ , then ∀ ∈ , .
to as lower and upper revised rough fuzzy approximation
Thus ∗ min : ∈
operators, respectively. ∗
min : ∈
∗
Therefore ⊆ ∗ .
Proposition 5.1. In a revised (two-universe) approximation
space , , , the approximation operators have the following ∗
. According to Lemma 3.1, if ∈ , then ⊆
properties for all , , ∈ :
. Thus
∗ ∗
∗ ∗
∗ min ∗ : ∈
. . min min : ∈ : ∈
∗ ∗
. . min min : ∈ : ∈
∗
. ∗
∩ ∗
∩ ∗
. min : ∈
∗
∗
. ∗
∪ ⊇ ∗
∪ ∗
. .
∗ ∗ ∗
∗ ∗ ∗ Hence ⊆ .
. ⊆ ⟹ ⊆ .
∗ ∗
. ⊆ ∗ ∗
. Remark 5.1. If R ∈ U V is a binary relation in a re-
∗
∗ ∗
. . vised (two-universe) approximation space U , V, R , then
∗
∗
. ∅ ∅. the following properties do not hold for all Y ∈ V :
∗ ∗ ∗
∗
. ∪ ∪ . ∗ ∗
∗
∗ ∗ ∗ . ∅ ∅.
. ∩ ⊆ ∩ . ∗ ∗
∗
∗ ∗ . ⊆ .
. ⊆ ⟹ ⊆ . ∗ ∗
∗
∗
∗ ∗ ∗ . ⊆ .
. ⊆ . ∗
∗
∗
∗
. ⊆ .
∗
∗
Proof. By the duality of approximation operators, we only . .
∗
∗
need to prove the properties ∗ ∗
and ∗ . ⊆ .
∗ ∗
. Since ∀∗ ∈ ∗
. ∗
⊆ .
1 max : ∈ ∗
∗ ∗ ∗
. ⊆ .
1 max 1 : ∈ ∗ ∗
∗
. ⊆ .
1 1 min : ∈
1 max : ∈
min : ∈ The following example shows Remark 5.1.
∗
∗
.
Therefore ∗ . Example 5.1. Let , , , , , , , , ,
, , , and ∈ be a binary relation de-
∗
. Since ∀ ∈ , 1 and ⊆ , then fined as:
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 3, MARCH 2012, ISSN 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 99
universes through the use of the intersection of right Information Sciences 177 (1) (2007) 41–73.
neighborhoods . All the properties of rough sets have [19] D.W. Pei, A Generalized Model of Fuzzy Rough Sets, Interna-
been simulated by employing this notion. It has been tional Journal of General Systems 34 (2005) 603–613.
revealed in this proposed model that the properties of [20] D.W. Pei, Z.B. Xu, Rough Set Models on Two Universes, In-
Pawlak approximation space are attainable if the rela- ternational Journal of General Systems 33 (5) (2004) 569–581.
tion is strong inverse serial. Finally, this notion has [21] D.W. Pei, Z.B. Xu, Transformation of Rough Set Models,
been expanded for the rough fuzzy sets and the prop- Knowledge-Based Systems 20 (2007) 745–751.
erties were the same reached by Dubois[4]. [22] S.K.M. Wong, L.S. Wang, Y.Y. Yao, Interval Structure: a
Framework for Representing Uncertain Information, in: Proc.
Conf. on Uncertain Artificial Intelligence, 1993, pp. 336–343.
[23] S.K.M. Wong, L.S. Wang, Y.Y. Yao, On Modeling Uncertainty
References with Interval Structure, Computational Intelligence 11 (1993)
[1] Z. Bonikowski, in: W.P. Ziarko (Ed.), Algebraic Structure of 406–426.
Rough Sets, Rough sets, Fuzzy Sets and Knowledge Discovery, [24] W.-Z. Wu, Y. Leung, J.-S. Mi, On Characterizations of (I, T )-
Springer-Verlag, London, 1994, pp. 242–247. Fuzzy Rough Approximation Operators, Fuzzy Sets and Sys-
[2] D. Chen, W. Zhang, D. Yeung, E.C.C. Tsang, Rough Approx- tems 154 (2005) 76–102.
imations on a Complete Completely Distributive Lattice with [25] W.-Z. Wu, W.-X. Zhang, Generalized Fuzzy Rough Sets, In-
Applications to Generalized Rough Sets, Information Sciences formation Sciences 15 (2003) 263–282.
176 (2006) 1829–1848. [26] W.-Z. Wu, W.-X. Zhang, Constructive and Axiomatic Ap-
[3] M.D. Cock, C. Cornelis, E.E. Kerre, Fuzzy Rough Sets: The proaches of Fuzzy Approximation Operators, Information
Forgotten Step, IEEE Transactions on Fuzzy Systems 15 (2007) Sciences 159 (2004) 233–254.
121–130. [27] Y.Y. Yao, Two Views of the Theory of Rough Sets in Finite
[4] D. Dubois, H. Prade, Rough Fuzzy Sets and Fuzzy Rough Universe, International Journal of Approximation Reasoning 15
Sets, International Journal of General System 17 (1990) 191–208. (1996) 291–317.
[5] M. Kondo, Algebraic Approach to Generalized Rough Sets, [28] Y.Y. Yao, Combination of Rough and Fuzzy Sets Based on α-
Lecture Notes in Artificial Intelligence 3641 (2005) 132–140. Level Sets. In: T.Y. Lin and N. Cercone, eds. Rough sets and data
[6] M. Kondo, On the Structure of Generalized Rough Sets, Infor- mining: analysis for imprecise data. Boston: Kluwer Academic
mation Sciences 176 (2006) 589–600. Publishers (1997) 301–321.
[7] T.J. Li, W.X. Zhang, Rough Fuzzy Approximations on Two [29] Y.Y. Yao, Constructive and Algebraic Methods of the Theory
Universes of Discourse, Information Sciences 178 (2008) 892– of Rough Sets, Information Sciences 109 (1998) 21–47.
906. [30] Y.Y. Yao, Relational Interpretations of Neighborhood Opera-
[8] T.Y. Lin, Neighborhood Systems and Approximation in Data- tors and Rough Set Approximation Operators, Information
base and Knowledge Bases, in: Proceedings of the Fourth Inter- Sciences 111 (1998) 239–259.
national Symposium on Methodologies of Intelligent Systems, 1989, [31] Y.Y. Yao, A Comparative Study of Formal Concept Analysis
pp. 75–86. and Rough Set Theory in Data Analysis, in: S. Tsumoto, R.
[9] T.Y. Lin, Topological and Fuzzy Rough Sets, in: R. Slowinski Slowinski (Eds.), Rough Sets and Current Trends in Computing,
(Ed.), Intelligent Decision Support: Hand Book of Applications and 4th International Conference (RSCTC 2004) Proceedings, LNCS
Advances of Rough Set Theory, Kluwer Academic Publishers, 3066, Springer-Verlag, 2004, pp. 59–68.
Dordrecht, London, 1992, pp. 287–304. [32] Y.Y. Yao, T.Y. Lin, Generalization of Rough Sets using Modal
[10] T.Y. Lin, Granular Computing for Binary Relations: Cluster- Logic, Intelligent Automation and Soft Computing International
ing and Axiomatic Granular Operators, in: Fuzzy Information, Journal 2 (1996) 103–120.
2004, Processing NAFIPS ’04, IEEE Annual Meeting, vol. 1, [33] Y.Y. Yao, S.K.M. Wong, T.Y. Lin, A Review of Rough Set
issue 27–30, June 2004, pp. 430–433. Models, in: T.Y. Lin, N. Cercone (Eds.), Rough Sets and Data
[11] T.Y. Lin, K.J. Huang, Q. Liu, W. Chen, Rough Sets, Neighbor- Mining: Analysis for Imprecise Data, Kluwer Academic Publish-
hood Systems and Approximation, in: Proceedings of the Fifth ers, Boston, 1997, pp. 47–75.
International Symposium on Methodologies of Intelligent Systems, [34] Y.Y. Yao, S.K.M. Wong, L.S. Wang, A Non-Numeric Ap-
Selected Papers, Knoxville, Tennessee 1990, pp. 130–141. proach to Uncertain Reasoning, International Journal of General
[12] G.L. Liu, Rough Sets over the Boolean Algebras, Lecture Notes Systems 23 (1995) 343–359.
in Artificial Intelligence 3641 (2005) 24–131. [35] W. Zhu, Generalized Rough Sets Based on Relations, Informa-
[13] G.L. Liu, Generalized Rough Sets over Fuzzy Lattices, Infor- tion Sciences 177 (22) (2007) 4997–5011.
mation Sciences 178 (2008) 1651–1662. [36] W. Zhu, F.Y. Wang, On Three Types of Covering Rough Sets,
[14] Z. Pawlak, Rough Sets, International Journal of Computer and IEEE Transactions on Knowledge and Data Engineering 19 (8)
Information Sciences 11 (1982) 341–356. (2007) 1131–1144.
[15] Z. Pawlak, Rough Sets-Theoretical Aspects of Reasoning
About Data, Kluwer Academic Publishers, Boston, MA, 1991.
[16] Z. Pawlak, A. Skowron, Rudiments of Rough Sets, Information
Sciences 177 (1) (2007) 3–27.
[17] Z. Pawlak, A. Skowron, Rough Sets: Some Extensions, Infor-
mation Sciences 177 (1) (2007) 28–40.
[18] Z. Pawlak, A. Skowron, Rough Sets and Boolean Reasoning,
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 3, MARCH 2012, ISSN 2151-9617
https://sites.google.com/site/journalofcomputing
WWW.JOURNALOFCOMPUTING.ORG 101