Abstract:According to the characteristics of non-core information system, one new heuristic attribute reduction algorithm is proposed based on mutual information, in which the evaluation of attribute importance depends on two indexes, the increment of mutual information and the information entropy. When one attribute is added to the reduction sets, the attribute with the largest attribute importance is selected for the core attribute. This method can solve the problem of increased computational complexity caused by the randomly selected attributes. The simulation experiments indicate that the proposed algorithm is effective, which can not only improve the efficiency of attribute reduction, but also decrease the number of attribute reduction.