A more efficient algorithm for attribute reduction based on the binary discernible matrix

Attribute reduction is one of the key problems for the rough set theory. It is not equally important in attributes of the information system, even some are redundant. Some information which are unimportant or non-relative can be deleted in the case that the resolutions of the information are not be changed. Nowadays the NP-hard problem has been proposed for searching the minimum attribute reduction of the information system. The common method to solve this problem is to adopt the heuristic algorithm. According to Zhi Tian-yun's binary discernible matrix reducible algorithm and the algorithm for attribute reduction based on the binary discernible matrix, the author designed a more efficient algorithm.