Attribute reduction algorithm based on indistinguishable degree

摘要

In order to overcome the shortcomings of computing attribute reduction based on discernibility matrix, an indistinguishable degree definition and the corresponding properties are introduced. By utilizing indistinguishable degree to depict the relative importance of attribute in information system, it proposes an effective indistinguishable degree algorithm for attribute reduction, which does not store discernibility matrix. In addition, an effective distinguish forest algorithm for attribute reduction is proposed to enhance the intuition about algorithm, and the effect about dig process. Besides, the example and experiments are used to illustrate the efficiency and feasibility of the proposed algorithm.