Issue No.09 - September (2005 vol.17)
Xiaoyan Liu , IEEE Computer Society
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2005.135
Discretization, as a preprocessing step for data mining, is a process of converting the continuous attributes of a data set into discrete ones so that they can be treated as the nominal features by machine learning algorithms. Those various discretization methods, that use entropy-based criteria, form a large class of algorithm. However, as a measure of class homogeneity, entropy cannot always accurately reflect the degree of class homogeneity of an interval. Therefore, in this paper, we propose a new measure of class heterogeneity of intervals from the viewpoint of class probability itself. Based on the definition of heterogeneity, we present a new criterion to evaluate a discretization scheme and analyze its property theoretically. Also, a heuristic method is proposed to find the approximate optimal discretization scheme. Finally, our method is compared, in terms of predictive error rate and tree size, with Ent-MDLC, a representative entropy-based discretization method well-known for its good performance. Our method is shown to produce better results than those of Ent-MDLC, although the improvement is not significant. It can be a good alternative to entropy-based discretization methods.
Index Terms- Data mining, data preparation, discretization, entropy, heterogeneity.
Xiaoyan Liu, Huaiqing Wang, "A Discretization Algorithm Based on a Heterogeneity Criterion", IEEE Transactions on Knowledge & Data Engineering, vol.17, no. 9, pp. 1166-1173, September 2005, doi:10.1109/TKDE.2005.135