关键词: 决策表, 算法, 粗糙集, 离散化

Abstract: In this paper, we give a more improved greedy algorithm for discretization of decision table. The importance of break point is decided amount of division a pair of example, and the importance of next break point is decided the choice of the break point when them are equally. The incertitude is removed in degree, and the algorithms are more perfect. The example of the end express that the algorithms may reduce the amount of break point and unknown the district.

Key words: decision table, algorithms, Rough sets, discretization