pith. sign in

arxiv: 1712.01117 · v1 · pith:PEB277CXnew · submitted 2017-12-01 · 💻 cs.IT · math.IT

Related families-based attribute reduction of dynamic covering information systems with variations of object sets

classification 💻 cs.IT math.IT
keywords coveringinformationsystemsdecisionattributewhenconsistentdynamic
0
0 comments X
read the original abstract

In practice, there are many dynamic covering decision information systems, and knowledge reduction of dynamic covering decision information systems is a significant challenge of covering-based rough sets. In this paper, we first study mechanisms of constructing attribute reducts for consistent covering decision information systems when adding objects using related families. We also employ examples to illustrate how to construct attribute reducts of consistent covering decision information systems when adding objects. Then we investigate mechanisms of constructing attribute reducts for consistent covering decision information systems when deleting objects using related families. We also employ examples to illustrate how to construct attribute reducts of consistent covering decision information systems when deleting objects. Finally, the experimental results illustrates that the related family-based methods are effective to perform attribute reduction of dynamic covering decision information systems when object sets are varying with time.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.