Abstract
Rough set theory has been one of the major mathematical tools in data mining and knowledge discovery. The basic concepts of rough set theory are a pair of non-numerical operators, i.e., lower and upper approximation operators that are exported from the approximation spaces. Set-valued ordered information systems are generalized models of single-valued information systems. The attribute set in an information system may vary due to the arrival of new information. In this paper, we focus on the incremental approach for dynamically updating approximations in the set-valued ordered information systems when the attribute set varies over time.
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.
