Study on discretization based on rough set theory

Discretization of attributes with real values is an important problem in data mining based on rough set. And discretization based on rough set has some particular characteristics. The method of discretization based on rough set and Boolean reasoning is discussed. Determination of. candidate cuts is discussed in detail. A theorem is proposed. to show that all bound cuts can discern the same objects pairs as the whole initial cuts. A strategy to select candidate cuts is proposed based on the theorem. Under the strategy, the space complexity and time complexity of improved algorithm decline obviously. The experiments results also confirm that.