Abstract
There is an intimate correlation between rough set theory and formal concept analysis theory, so rough set approximations can be realized by means of formal concept analysis. For any given multiple valued information system, the realization of rough set approximation operation has two major steps, firstly convert the information system from multiple valued one to single valued formal context, secondly realize rough set approximation operations aided by concept lattice, which is equivalent to a query operation under some necessary conditions.
Highlights
Rough set theory (RS), first described by a Polish computer scientist Zdzisław I
Realization of rough set approximation operation can be divided into two steps: first, convert multiple valued information system to multiple valued formal context, and covert multiple value formal context to single value formal context; second, realize rough set approximation operation by using the technique of formal concept analysis based on concept lattice
There is an intimate link between rough set theory and concept lattice, so rough set approximation operation can be realized being aided by Formal concept analysis (FCA)
Summary
Rough set theory (RS), first described by a Polish computer scientist Zdzisław I. Zhi first reveals limitations of data analysis and processing in the rough set theory, and provides a way for the synthesis of formal concept analysis and rough set theory by using nominal scale. In these studies, the link between rough set theory and concept lattice is pointed out, but in practice how to realize the operation of rough set by using concept lattice is still left as a problem. In this article, we focus on the way to realize rough set approximation topological operations based concept lattice, which includes upper approximation and lower approximation
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.