A New Algorithm of Discretization of Consecutive Attributes Based on the Decision in Rough Sets
基于决策的剥离式连续属性离散化算法

Proposed a new algorithm of discretization of consecutive attributes based on the decision according to the limitation that Rough Set Theory can only deal with the discrete attributes in database.Unlike traditional methods,the initial candidate points are obtained by analyzing the distribution ranges of consecutive attributes in each decision sort and computing their attribution significances.At the same time,proposed some rules of decreasing candidate points in order to increasee the velocity of system convergence.Using the algorithm,the decision table after discretization will be always consistent and can reserve useful information as much as possible.Finally,the algorithm is field-independent and can be used in different fields without any additional information.