A top-down and greedy method for discretization of continuous attributes

Abstract

Experiments show that CAIM discretization algorithm is superior to all the other top-down discretization algorithms. However CAIM algorithm does not take the data distribution into account. The discretization formula used in CAIM also gives a high factor to the numbers of generated intervals. The two disadvantages make CAIM may generate irrational discrete results in some cases and further leads to the decrease of predictive accuracy of a classifier In this paper we propose the Class-Attribute Contingency Coefficient discretization algorithm. The experimental results showed that compared with CAIM, our method can generate a better discretization scheme to bring on the improvement of accuracy of classification. With regard to the number of generated rules and execution time of a classifier CACC and CAIM achieve comparable results.