Research on attribute reduction algorithm

In this paper, by the comprehension and analysis of data mining algorithm based on tradition rough set theory, on improved discernibility matrix, the information for core and reduction without inclusion relation is gained in the process of comparing objects. Based on this information, a new heuristic algorithm for reduction is proposed. Aiming at the situation in real application which data are always changing in Database, an incremental algorithm of attributes reduction is proposed. This algorithm can avoid reduction from the large original decision table when new objects are added. It can update and vindicate the results of reduction for original Table, and improve the efficiency of attributes reduction for database. The algorithm is demonstrated to be effective with the specific example ultimately.