Abstract
Attributes reduction is one of the most important subjects of knowledge discovery in information systems. As an approach of attributes reduction, binary discernibility matrices have many interesting properties. Due to the disadvantage of binary discernibility matrices in dealing with variable precision rough set (VPRS), this paper presents an approach to knowledge reduction based on the binary discernibility matrix which is redefined formally based on traditional binary discernibility matrices, and is called the extensive binary discernibility matrix. From the practice point of view, two-valued decision attributes are general, our discussions are concentrated on this kind of decision information system (DIS), some conclusions about attributes reduction and computative examples are given in this paper.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
