Affiliations: [a] College of Computer, Minnan Normal University, Zhang’zhou, Fu’jian 363000, China. [email protected] | [b] School of Mathematics and Statistics, Minnan Normal University, Zhang’zhou, Fu’jian 363000, China
Correspondence:
[†]
Address for correspondence: College of Computer, Minnan Normal University, Zhang’zhou, Fu’jian 363000, China.
Note: [*] This work was supported by Grants from the National Natural Science Foundation of China (No. 11526109, 61379021), Natural Science Foundation of Fujian (Grant Nos. 2015J05011, 2016J01671, JK2014028), and the outstanding youth foundation of the Education Department of Fujiang Province.
Abstract: Rough set theory is an important tool to deal with vagueness and granularity in information systems. Lower and upper approximation operators are two important basic concepts in the rough set theory. The classical Pawlak rough set approximations is based on equivalence relations and has been extended to relation-based generalized rough set approximations. In this paper, properties of relation-based generalized rough set approximations are examined, and topological properties of relation-based generalized rough set approximations presents. Necessary and sufficient conditions for the relation-based generalized upper (lower) approximation operators to be topological closure (interior) operators are proposed.
