An Improved Method of Attribute Reduction

Attribution reduction is one of the key problems on rough set theory.Nowadays searching the optimal attribute reduction of the information system has been proposed the NP-hard problem.Based on the conjunction discernible matrix takes the strategy of the greedy algorithm we propose a kind of heuristic algorithm to get the optimal reduction in this paper.This algorithm can obtain the optimal reduction through the expansion of the core attributes in which there are cores of the decision table.Moreover in non-core decision table,it can also act according to this attribute the frequency which appears in the conjunction difference matrix to obtain optimal reduction.All experiment shows that the algorithm is highly effective.