Affiliations: [a] School of Science, Jimei University, Xiamen, 361021, China. [email protected] | [b] School of Science, Chongqing University of Technology, Chongqing, 400054, China. [email protected]
Correspondence:
[*]
Address for correspondence: School of Science, Chongqing University of Technology, Chongqing, 400054, China.
Abstract: Rough set theory is one of the most important tools for data mining. The covering rough set (CRS) model is an excellent generalization of Pawlak rough sets. In this paper, we first investigate a number of basic properties of two types of CRS models. Especially, we study the operation properties of the two types of CRS models with respect to the unary covering. Meanwhile, several corresponding algorithms are constructed for computing the intersection and union of rough sets and some examples are employed to illustrate the effectiveness of these algorithms.Finally, as an application of the operation properties of CRS, some basic algebraic properties of CRS are explored. It is evident that these results will enrich the theory of covering rough sets.
