The application of ant colony optimization to the classification rule problem

The goal of data mining is to extract knowledge from data. The discovered knowledge plays an important role in decision making. Accordingly, the comprehensibility of the discovered knowledge is very critical. If the discovered knowledge is not comprehensible, it will not be useful for decision making, even leads to an incorrect decision. Data mining is an interdisciplinary research topic. There are various data mining tasks. This paper focuses on the solving for classification rule problem. Classification rule is the most common representation of the rule in data mining. It belongs to the supervised learning process which generates rules from training data set. The goal of the classification rule mining is the prediction of the predefined class. Considering the classification task of data mining, discovered knowledge is often expressed in the form of IF-THEN rules. Rafael S. Parpinelli etc. proposed the Ant-Miner algorithm. Based on ACO algorithm, Ant-Miner solved the classification rule problem. In its basic configuration, Ant-Miner shows good performance in many dataset. In this paper, an extension of Ant-Miner is proposed to incorporate the concept of parallel processing and grouping. Intercommunication via pheromone among ants is a critical part in ant colony optimization's searching mechanism. Due to the algorithm design, Ant-Miner made a slight modification in this part which removes the parallel searching capability. Based on Ant-Miner, we propose an extension that modifies the algorithm design to incorporate parallel processing. The pheromone trail deposited by ants during searching affected each other. With the help of pheromone, ants can have better decision making while searching. For solving the classification rule problem, we design an algorithm with the concept of multi-level rule choosing mechanism in order to get more accuracy of rule induced. Furthermore, we provide a possible direction for researches toward the classification rule problem.

[1]  Cheng-Fa Tsai,et al.  A new hybrid heuristic approach for solving large traveling salesman problem , 2004, Inf. Sci..

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

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

[4]  Thomas Stützle,et al.  Improvements on the Ant-System: Introducing the MAX-MIN Ant System , 1997, ICANNGA.

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

[6]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[7]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[8]  B. Bullnheimer,et al.  A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .

[9]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[10]  J. A. Bland Space-planning by ant colony optimisation , 1999 .

[11]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[12]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[13]  F. Aida,et al.  Max{min Ant System for Quadratic Assignemnt Problems Max{min Ant System for Quadratic Assignment Problems , 1997 .

[14]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[15]  Barbara Webb,et al.  Swarm Intelligence: From Natural to Artificial Systems , 2002, Connect. Sci..