Improved heuristic algorithm of attribute reduction based on rough set theory

An improved heuristic algorithm of attribute reduction in rough set theory is presented.It has been proved to be a NP-hard problem to search for the minimum attribute set.People usually adopt heuristic algorithm to find approximately optimum solution,but there may exit attribute redundance in the obtained attribute reduction.Considering the non-soundness of current heuristic algorithms,with the help of dependence and significance of attribute in Rough Sets,the heuristic information is constructed,and the process of the second reduction is added to the algorithm in order to eliminate the attribute redundance,then an improved heuristic algorithm is obtained.The correctness and effectiveness of the improved algorithm was demonstrated by an experiment.