Abstract
The attribute reduction definitions based on algebra view, based on information entropy view and based on Skowron's discernibility matrix are familiar in rough set theory. It was proved that these three definitions of attribute reduction are not equivalent to each other. Recently, some researchers provided a new entropy method for decision table. And based on this method, a new information view that could comprehensively illustrate the algebra view is introduced. For getting the illustration of the attribute reduction based on Skowron's discernibility matrix with information view, it is proved that the new attribute reduction definition based on the new information entropy proposed by other researchers is equivalent to that based on Skowron's discernibility matrix. It will also provide more ways to design efficient algorithm of attribute reduction based on Skowron's discernibility matrix.
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.
