ACORI: a novel ACO algorithm for rule induction
作者:
Highlights:
•
摘要
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.
论文关键词:RIPPER,Ant Colony Optimization (ACO),Rule reordering,Decision list
论文评审过程:Received 27 July 2015, Revised 3 January 2016, Accepted 4 January 2016, Available online 22 January 2016, Version of Record 20 February 2016.
论文官网地址:https://doi.org/10.1016/j.knosys.2016.01.005