Discretization of Continuous Attributes in Rough Set Theory Based on Information Entropy

In this paper a new discretization algorithm of continue attributes in rough set is offered. Firstly, a information entropy is defined for every candidate cut point and treated as a measurement of importance. On the basis of that, a discretization algorithm of continue attributes in rough set for selecting cut points is illustrated. Finally, a group of data set is applied to test the performance of the algorithm and the experiment result is compared with other discretization algorithm. The experiment result shows that the algorithm is effective, and keeps a high computing efficiency when the number of candidate cut point increase.