Attribute Reduction Algorithm Realization in Rough Set

Attribute reduction is one of the key topics in the rough set theory field.It has been proven that computing the optimal reduction of decision table is an N P-hard problem.Firstly,this paper introduces the basic attribute reduction algorithm in discernibility matrix and the improved core algorithm.Then,based on it two types of significance of attribute in a decision table are defined,then,an algorithm which uses rough set theory with heuristic information is proposed.Finally,the experimental result shows that the algorithm can obtain the optimal attribute reduction of decision table efficiently in most cases.