The Algorithm for the Reduction of Decision Table Based on Rough Entropy

The attribute reduction is a core theory of the rough set theory. It has been proven that computing the optimal reduction of decision table is a NP-hard problem. In the paper here, the application of rough entropy in rough sets theory is analyzed, the uncertainty measure of the importance of attribute in decision table is proposed, then, a heuristic algorithm based on rough entropy for reduction of knowledge is proposed.