Abstract
The theory of Rough set has proposed a method for approximating concepts by using a pair of thresholds on probability to defined three regions, namely, the positive, boundary and negative regions. These three regions generate three-way decision rules, which are acceptance, deferment and rejection decisions. In fact, the decision environment is prone to dynamic with the data changed continuously. As such, the three regions of a target decision will be changed inevitably. There are having been many studies on methods for incremental updating three-way decisions by adding or deleting objects in different threads. In this paper, we combine addition and deletion operators in a single updating step for three-way decisions in incomplete information system and mathematically proof our proposed methods.
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.
