Abstract

Attribute reduction is a very important part of rough set theory. However, the cost of reduct computation is highly influenced by the size of object set and attribute set, so enhancing the reduct computation efficiency is one of the major problems. This paper proposes a reduction algorithm capable of reducing the time cost by using the binary discernibility matrix. Based on analyzing the binary discernibility matrix, the concept of attribute significance is defined at two aspects, which is applied to lead the solutions to optimization. The validity and efficiency of the proposed algorithm is verified by comparing with other two reduction algorithms on various standard domains.

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.