An Ant Colony Optimization Algorithm for Learning Classification Rules

Ant colony optimization (ACO) algorithm has been applied to data mining recently. Aiming at Ant Miner, a classification rule learning algorithm based on ACO, this paper presents an enhanced Ant Miner, which includes two main contributions. Firstly, a rule punishing operator is employed to reduce the number of rules and the number of conditions. Secondly, an adaptive state transition rule and a mutation operator are applied to the algorithm to speed up the convergence rate. The results of experiments on some data sets demonstrate that the enhanced Ant-Miner can quickly discover better classification rules which have roughly competitive predicative accuracy and short rules

[1]  Zhijun Yang,et al.  An ant colony optimization algorithm based on mutation and dynamic pheromone updating , 2004 .

[2]  Hussein A. Abbass,et al.  Classification rule discovery with ant colony optimization , 2003, IEEE/WIC International Conference on Intelligent Agent Technology, 2003. IAT 2003..

[3]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[4]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[5]  Alex Alves Freitas,et al.  Data mining with an ant colony optimization algorithm , 2002, IEEE Trans. Evol. Comput..

[6]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[7]  G. C. Gupta.  WEB INTELLIGENCE , 2004 .

[8]  Ziqiang Wang,et al.  Classification Rule Mining with an Improved Ant Colony Algorithm , 2004, Australian Conference on Artificial Intelligence.

[9]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[10]  Yiyu Yao,et al.  Web Intelligence (WI): A New Paradigm for Developing the Wisdom Web and Social Network Intelligence , 2003 .