The Community for Technology Leaders
Green Image
Issue No. 02 - February (2004 vol. 16)
ISSN: 1041-4347
pp: 145-153
<p><b>Abstract</b>—The task of extracting knowledge from databases is quite often performed by machine learning algorithms. The majority of these algorithms can be applied only to data described by discrete numerical or nominal attributes (features). In the case of continuous attributes, there is a need for a discretization algorithm that transforms continuous attributes into discrete ones. This paper describes such an algorithm, called CAIM (class-attribute interdependence maximization), which is designed to work with supervised data. The goal of the CAIM algorithm is to maximize the class-attribute interdependence and to generate a (possibly) minimal number of discrete intervals. The algorithm does not require the user to predefine the number of intervals, as opposed to some other discretization algorithms. The tests performed using CAIM and six other state-of-the-art discretization algorithms show that discrete attributes generated by the CAIM algorithm almost always have the lowest number of intervals and the highest class-attribute interdependency. Two machine learning algorithms, the CLIP4 rule algorithm and the decision tree algorithm, are used to generate classification rules from data discretized by CAIM. For both the CLIP4 and decision tree algorithms, the accuracy of the generated rules is higher and the number of the rules is lower for data discretized using the CAIM algorithm when compared to data discretized using six other discretization algorithms. The highest classification accuracy was achieved for data sets discretized with the CAIM algorithm, as compared with the other six algorithms.</p>
Supervised discretization, class-attribute interdependency maximization, classification, CLIP4 machine learning algorithm.

L. A. Kurgan and K. J. Cios, "CAIM Discretization Algorithm," in IEEE Transactions on Knowledge & Data Engineering, vol. 16, no. , pp. 145-153, 2004.
94 ms
(Ver 3.3 (11022016))