|
计算机应用研究 2007
Study on comparison of discretization algorithms of continuous attributes
|
Abstract:
This paper disscussed four kinds of discretization methods which include greedy and some improved algorithms, significance of attributes, entropy of information and clustering-based algorithms. And compard the quality of the four categories of algorithms. The last experiments indicate that the quality of discretization of dataset not only lies on the algorithm, but also is closely related to distributing of continuous attributes and data of decision.