Abstract
As a technique for granular computing, rough sets deal with the vagueness and granularity in information systems. Covering-based rough sets are natural extensions of the classical rough sets by relaxing the partitions to coverings and have been applied for many fields. In this paper, a new type of covering-based rough sets are proposed and the properties of this new type of covering-based rough sets are studied. First, we introduce a concept of inclusion degree into covering-based rough set theory to explore some properties of the new type of covering approximation space. Second, a new type of covering-based rough sets is established based on inclusion degree. Moreover, some properties of the new type of covering-based rough sets are studied. Finally, a simple application of the new type of covering-based rough sets to network security is given.
Author supplied keywords
Cite
CITATION STYLE
Yang, B., & Zhu, W. (2014). A new type of Covering-Based rough sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8818, pp. 489–499). Springer Verlag. https://doi.org/10.1007/978-3-319-11740-9_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
