Abstract
Rough set theory is a powerful tool for dealing with uncertainty, granularity, and incompleteness of knowledge in information systems. This paper systematically studies a type of generalized rough sets based on covering and the relationship between this type of covering-based rough sets and the generalized rough sets based on binary relation. Firstly, we present basic concepts and properties of this kind of rough sets. Then we investigate the relationships between this type of generalized rough sets and other five types of covering-based rough sets. The major contribution in this paper is that we establish the equivalency between this type of covering-based rough sets and a type of binary relation based rough sets. Through existing results in binary relation based rough sets, we present axiomatic systems for this type of covering-based lower and upper approximation operations. In addition, we explore the relationships among several important concepts such as minimal description, reduction, representative covering, exact covering, and unary covering in covering-based rough sets. Investigation of this type of covering-based will benefit to our understanding of other types of rough sets based on covering and binary relation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
