Study on improvement of data Discretization methods

In the practical application of rough sets, the continuous attribute has to be discreted. This paper analyzed data Discretization using a heuristic method. Firstly, the discretization of the continuous attribute of rough sets is formally described. Discretization essentially boils down to use the breakpoints to divide the space of conditional attributes. Through the simplification of the initial breakpoint, the famous algorithm by Nguyen S H was improved. And the improved algorithm is greatly reduced in space complexity and time complexity.