C4.5: programs for machine learning
C4.5: programs for machine learning
Hi-index | 0.00 |
In this paper an Incremental GA techniques is proposed tosolve the problem of small disjuncts in classification trees. It is once applied on the disjuncts sorted in ascending orderand once in descending order with respect to their coverage. Both versions of the technique have been tested using benchmark datasets and the results are compared with thoseof other hybrid techniques.