Algorithm for attribute relative reduction based on generalized binary discernibility matrix

摘要

The classical rough set theory, based on complete information system, can not directly deal with incomplete information system. This problem is solved to some extent by developing different kinds of extended rough set models. However, there is still not a unified definition for attributes relative reduction based on the extended rough set models. In this paper, a kind of generalized binary discernibility matrix for several typical extended rough set models was introduced, and a new algorithm for attribute relative reduction based on the generalized binary discernibility matrix was proposed. The feasibility of the proposed methods was demonstrated by the simulation and experiment analysis.