Abstract

This article deals with approaches to knowledge reductions in inconsistent information systems (ISs). The main objective of this work was to introduce a new kind of knowledge reduction called a maximum distribution reduct, which preserves all maximum decision classes. This type of reduction eliminates the harsh requirements of the distribution reduct and overcomes the drawback of the possible reduct that the derived decision rules may be incompatible with the ones derived from the original system. Then, the relationships among the maximum distribution reduct, the distribution reduct, and the possible reduct were discussed. The judgement theorems and discernibility matrices associated with the three reductions were examined, from which we can obtain approaches to knowledge reductions in rough set theory (RST). © 2003 Wiley Periodicals, Inc.

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

Disclaimer: 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.