Abstract
Covering-based rough sets and formal concept analysis are two complementary tools for data analysis. This study systematically explores their connections in terms of approximation operators, structures and knowledge reduction. First, we show that three pairs of approximation operators—element-based, granule-based and subsystem-based, in covering-based rough sets, are accordant with the approximation operators in formal concept analysis. On this basis, one can easily conclude that the approximation spaces of coverings and concept lattices are related and that their reducts are coincident. Second, the high-level approximation operators of formal concept analysis are introduced into covering-based rough sets. In the end, we construct several reduction algorithms for a covering that could also be used to compute the reducts of a formal context. Experiments are conducted to assess their efficiencies.
Sign-in/Register to access full text options 
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.
