A new sequential covering strategy for inducing classification rules with ant colony algorithms

Otero, Fernando E.B., Freitas, Alex A., Johnson, Colin G. (2013) A new sequential covering strategy for inducing classification rules with ant colony algorithms. IEEE Transactions on Evolutionary Computation, 17 (1). pp. 64-76. ISSN 1089-778X. (doi:10.1109/TEVC.2012.2185846) (KAR id:34305)

PDF Author's Accepted Manuscript
Language: English

 Preview
Official URL
http://dx.doi.org/10.1109/TEVC.2012.2185846

Abstract

Ant colony optimization (ACO) algorithms have been successfully applied to discover a list of classification rules. In general, these algorithms follow a sequential covering strategy, where a single rule is discovered at each iteration of the algorithm in order to build a list of rules. The sequential covering strategy has the drawback of not coping with the problem of rule interaction, i.e., the outcome of a rule affects the rules that can be discovered subsequently since the search space is modified due to the removal of examples covered by previous rules. This paper proposes a new sequential covering strategy for ACO classification algorithms to mitigate the problem of rule interaction, where the order of the rules is implicitly encoded as pheromone values and the search is guided by the quality of a candidate list of rules. Our experiments using 18 publicly available data sets show that the predictive accuracy obtained by a new ACO classification algorithm implementing the proposed sequential covering strategy is statistically significantly higher than the predictive accuracy of state-of-the-art rule induction classification algorithms.

Item Type: Article 10.1109/TEVC.2012.2185846 rule induction, ant colony optimization, data mining, machine learning, classification Q Science > Q Science (General) > Q335 Artificial intelligence Faculties > Sciences > School of Computing > Computational Intelligence Group Fernando Otero 17 Jun 2013 17:06 UTC 04 Feb 2020 04:05 UTC https://kar.kent.ac.uk/id/eprint/34305 (The current URI for this page, for reference purposes) https://orcid.org/0000-0003-2172-297X https://orcid.org/0000-0001-9825-4700 https://orcid.org/0000-0002-9236-6581
• Depositors only (login required):