Attribute Reduction Algorithm on Rough Set and Information Entropy and Its Application

This paper expounds the basic conceptions of the rough set theory and information entropy.In order to find the effective approach of attribute reduction,an algorithm of attribute reduction based on rough set and information entropy is put forward.In decision table,a size of mutual information caused by an attribute reflects on the attribute significance,and gets the relative reduction.The studies show that the algorithm not only can get the optimal decision rules,but also can greatly decrease search space that the information system requires,and get more perfect attribute reduction effect.