Comparison between different kinds of approximations by using a family of binary relations

被引:45
作者
Abu-Donia, H. M. [1 ]
机构
[1] Zagazig Univ, Fac Sci, Dept Math, Zagazig, Egypt
关键词
Lower and upper approximations; Right neighborhood; Binary relations and rough sets;
D O I
10.1016/j.knosys.2008.03.046
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we discuss three types of lower and upper approximations of any set with respect to any relation based on right neighborhood. We generalize these three types of approximations into two ways by using a finite number of any binary relations. The first way based on the intersection of the right neighborhoods for a family of binary relations, the second based on the union and intersection of lower and upper approximations of a set according to a family of binary relations {R-i : i = 1,2..... n}. Also, we make a comparison between these types in tables. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:911 / 919
页数:9
相关论文
共 12 条
[1]  
[Anonymous], 1987, Bull. Polish Acad. Sci. Math
[2]  
[Anonymous], 1991, ROUGH SETS THEORETIC
[3]  
ORLOWSKA E, 1984, B POLISH ACAD SCI TH, V32, P617
[4]   INFORMATION-SYSTEMS THEORETICAL FOUNDATIONS [J].
PAWLAK, Z .
INFORMATION SYSTEMS, 1981, 6 (03) :205-218
[5]   ROUGH SETS [J].
PAWLAK, Z .
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1982, 11 (05) :341-356
[6]  
Pomykala JA, 1987, Bull Polish Acad Sci, V35, P653
[7]  
Skowron A., 1996, Fundamenta Informaticae, V27, P245
[8]  
SKOWRON A, 1995, SOFT COMPUTING SIMUL, P18
[9]  
Wybraniec-Skardowska U., 1989, Bull. Pol. Acad. Sci., Math., V37, P51
[10]  
Yao YY, 1999, PROC 9 INT C, P44