Knowledge reduction in incomplete information systems based on dempster-shafer theory of evidence

  • Authors:
  • Weizhi Wu;Jusheng Mi

  • Affiliations:
  • Information College, Zhejiang Ocean University, Zhoushan, Zhejiang, P.R. China;College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang, Hebei, P.R. China

  • Venue:
  • RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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