Abstract

Knowledge reduction is one of the main problems in the study of rough set theory. This paper deals with knowledge reduction in incomplete information systems based on Dempster-Shafer theory of evidence. The concepts of plausibility and belief consistent sets as well as plausibility and belief reducts in incomplete information systems are introduced. It is proved that a plausibility consistent set in an incomplete information system must be a consistent set and an attribute set in an incomplete information system is a belief reduct if and only if it is a classical reduct.

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