Affiliations: College of Mathematics and Computer Science, Shanxi Normal University, Linfen, 041004, P.R.China | School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, 611731, P.R.China. [email protected]
Note: [] Address for correspondence: College of Mathematics and Computer Science, Shanxi Normal University, Linfen, 041004, P.R.China
Abstract: Rough set theory is an important technique in knowledge discovery in databases. In covering-based rough sets, seven types of rough set models were established in recent years. This paper defines the concept of maximal description of an element, and further explores the properties and structures of several types by means of the concepts of maximal description and minimal description. Finally, we study the relationship between covering-based rough sets and the generalized rough sets based on binary relation.
