Neighborhood operators for covering-based rough sets

被引:90
作者
D'eer, Lynn [1 ]
Restrepo, Mauricio [2 ]
Cornelis, Chris [1 ,3 ]
Gomez, Jonatan [4 ]
机构
[1] Univ Ghent, Dept Appl Math Comp Sci & Stat, B-9000 Ghent, Belgium
[2] Univ Mil Nueva Granada, Dept Math, Bogota, Colombia
[3] Univ Granada, Dept Comp Sci & Artificial Intelligence, Res Ctr Informat & Commun Technol CITIC UGR, Granada, Spain
[4] Univ Nacl Colombia, Dept Comp Sci & Engn, Bogota, Colombia
关键词
Rough sets; Coverings; Binary relations; Approximation operators; Neighborhood operators; APPROXIMATION OPERATORS; ATTRIBUTE REDUCTION; SYSTEMS;
D O I
10.1016/j.ins.2015.12.007
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Covering-based rough sets are important generalizations of the classical rough sets of Pawlak. A common way to shape lower and upper approximations within this framework is by means of a neighborhood operator. In this article, we study 24 such neighborhood operators that can be derived from a single covering. We verify equalities between them, reducing the original collection to 13 different neighborhood operators. For the latter, we establish a partial order, showing which operators yield smaller or greater neighborhoods than others. Six of the considered neighborhood operators result in new covering-based rough set approximation operators. We study how these new approximation operators relate to existing ones in terms of partial order relations, i.e., whether the generated approximations are in general greater, smaller or incomparable. Finally, we discuss the connection between the covering-based approximation operators and relation-based approximation operators, another prominent generalization of Pawlak's rough sets. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:21 / 44
页数:24
相关论文
共 35 条
[1]  
[Anonymous], P IEEE INT C INT SYS
[2]  
Bazan JG, 2000, STUD FUZZ SOFT COMP, V56, P49
[3]   Extensions and intentions in the rough set theory [J].
Bonikowski, Z ;
Bryniarski, E ;
Wybraniec-Skardowska, U .
INFORMATION SCIENCES, 1998, 107 (1-4) :149-167
[4]   A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets [J].
Chen Degang ;
Wang Changzhong ;
Hu Qinghua .
INFORMATION SCIENCES, 2007, 177 (17) :3500-3518
[5]   Boolean algebras arising from information systems [J].
Düntsch, N ;
Orlowska, E .
ANNALS OF PURE AND APPLIED LOGIC, 2004, 127 (1-3) :77-98
[6]  
Fernandez Y., 2013, DYNA-COLOMBIA, V182, P182
[7]   Rough set approach to incomplete information systems [J].
Kryszkiewicz, M .
INFORMATION SCIENCES, 1998, 112 (1-4) :39-49
[8]   ROUGH SETS [J].
PAWLAK, Z .
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1982, 11 (05) :341-356
[9]  
Pomykala J.A., 1987, Bull. Pol. Acad. Sci, V35, P653
[10]  
Restrepo M, 2014, LECT NOTES COMPUT SC, V8537, P143