Title :
Relational Perspectives on Covering Based Rough Approximation Operators
Author_Institution :
Dept. of Comput. Eng., Anhui Inst. of Archit. & Ind., Hefei, China
Abstract :
Generalized rough set models based on arbitrary binary relation and covering are two meaningful extensions of Pawlak´s rough set, and their relationship is an important and interesting issue. Any covering can induce two binary relations, one being a tolerance and the other being the specialization preorder. In this paper, four pairs of covering based rough upper and lower approximation operators are proved to be precisely Cech quasi-discrete closure and interior operators corresponding to the induced tolerance and specialization preordering, respectively. Axiomatic characterizations of these four types of covering rough upper (dually, lower) approximation operators are also discussed.
Keywords :
approximation theory; rough set theory; Cech quasi-discrete closure operator; Cech quasi-discrete interior operators; Pawlak rough set; arbitrary binary relation; covering based rough lower approximation operators; covering based rough upper approximation operators; generalized rough set models; relational perspectives; specialization preorder; tolerance; Approximation methods; Computers; Indexes; Information science; Kernel; Rough sets; binary relation; covering; rough approximation operator;
Conference_Titel :
Industrial Control and Electronics Engineering (ICICEE), 2012 International Conference on
Conference_Location :
Xi´an
Print_ISBN :
978-1-4673-1450-3
DOI :
10.1109/ICICEE.2012.181
