Abstract

RIPPER is certainly one of the best rule induction algorithms. In RIPPER, the order in which the rules are learned is important because the first rule to be fired determines the class of the instance. However, the correct class may be identified by another rule further down the list, which is ignored and, thus never examined. This paper offers a contribution to address the mentioned shortcoming. An Ant Colony Optimization (ACO) algorithm is developed for finding the optimal order of rules in the decision list. This algorithm is called ACO for Rule Induction (ACORI). To the best of our knowledge, this is the first paper that devises an optimization method to determine the (near) optimal order of rules in the decision list. The performance of the proposed algorithm is compared to that of RIPPER using 10 data sets. Experimental results and non-parametric statistical tests show that the proposed algorithm significantly outperforms the original RIPPER.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.