Abstract

The data we need to deal with are getting bigger and bigger in recent years, and the same happens to multi-granulation rough sets, so updated schemes have been proposed with the variation of attributes or attribute values in multi-granulation rough sets. This paper puts forward a dynamic mechanism to update the approximations in multi-granulation rough sets when increasing or decreasing objects. Firstly, the relationships between the original approximations and updated approximations are explored when adding or deleting objects and the dynamic processes of updating the lower and upper approximations in optimistic and pessimistic approximations are proposed. Secondly, two corresponding dynamic algorithms and their time complexity are given. Finally, the experimental evaluations show the effectiveness of the proposed dynamic updating algorithms compared with the static algorithm.

Full Text
Published version (Free)

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 call