A Novel Method for Extracting Classification Rules Based on Ant-miner

Volume 8, Issue 4, pp 377-386 http://dx.doi.org/10.22436/jmcs.08.04.06

Download PDF

Download XML

• Export citations
  • CITATIONS & REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • ARTICLE CITATION
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)

• 2413 Downloads
• 3381 Views

Authors

Babak Fakhar - Department of Computer Science, Mahshahr branch, Islamic Azad University, Mahshahr, Iran.

Abstract

In this paper, we propose a new method for data mining based on Ant Colony Optimization (ACO). The ACO is a metheuristic inspired by the behavior of real ants, where they search for optimal solutions by considering both local heuristic and previous knowledge, observed by pheromone changes. Good results of the ant colony algorithms for solving combinatorial optimization problems suggest an appropriate effectiveness of the approach also in the task of discovering classification rules in data mining. Mining classification rules is an important research area in data mining. Ant-Miner is an Ant Colony Optimization algorithm for classification task. This paper proposes an improved version of Ant-Miner named Ant-Miner4, which is based on Ant-Miner3 By changing the heuristic function used in the Ant-Miner3, and implementing it based on correction function of Laplace, we tried to redesign Ant-Miner to gain rules with high predictive accuracy. We compared Ant-Miner4 with the previous version (Ant-Miner3) using four data sets. The results indicated that the accuracy of the rules discovered by the new version was higher than the ones gained by the previous version.

Share and Cite

Keywords

• Ant Colony Optimization Algorithm
• Classification Rules
• Data Mining
• Laplace Correction

MSC

•  68T05

References

• [1] S. M. Weiss, C. A. Kulikowski, Computer Systems that Learn, CA: Morgan Kaufmann, San Francisco (1991)
  • Google Scholar


• [2] A. A. Freitas, S. H. Lavington, Mining Very Large Databases with Parallel Processing, UK: Kluwer, London (1998)
  • Google Scholar


• [3] T. M. Cover, J. A. Thomas, Elements of Information Theory, NY: John Wiley & Sons, New York (1991)
  • Google Scholar


• [4] M. Dorigo, G. Di Caro, L. M. Gambardella, Ant algorithms for discrete optimization, Artificial Life, 5 (2000), 137-172
  • View Article
  • Google Scholar


• [5] U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, From data mining to knowledge discovery: an overview, In: Advances in Knowledge Discovery & Data Mining, U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy (Eds.) Cambridge, MA: AAAI/MIT, (1996), 1-34
  • View Article
  • Google Scholar


• [6] M. Dorigo, V. Maniezzo, The ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics, 26(1) (1996), 1-13
  • Google Scholar


• [7] Ziqiang Wang, Boqin Feng, Classification Rule Mining with an Improved Ant Colony Algorithm, Lecture Notes in Computer Science, Volume 3339 (2004)
  • View Article
  • MathSciNet
  • Google Scholar


• [8] L. A. Brewlow, D. W. Aha, Simplifying decision trees: a survey, The Knowledge Engineering Review, 12 (1997), 1-40
  • View Article
  • Google Scholar


• [9] M. Dorigo, A. Colorni, V. Maniezzo, The Ant System: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26 (1996), 29-41
  • Google Scholar


• [10] M. P. Oakes, Ant Colony Optimization for Stylometry: The Fedaralist Papers, International Conference on Recent Advances in Soft Computing, (2004)
  • Google Scholar


• [11] Bo Liu, Hussein A. Abbass, Bob McKay, Classification Rule Discovery with Ant Colony Optimization , IEEE Computational Intelligence, Bulletin (2004)
  • View Article
  • Google Scholar


• [12] Lotti Admane, Karima Benatchba, Mouloud KOUDIL, Habiba, Using ant colonies to solve data-mining problems, DFUAS IEEE International Conference on Systems, Man and Cybernetics Said GHAROUT and Nacer HAMAN1 Institut National de formation en Informatique, BP 68M, 16270, Oued Smar , Alg6rie (2003)
  • View Article
  • Google Scholar


• [13] R. Parepinelli, S. Lopes, An Ant Colony Algorithm for Classification Rule Discovery, In H. A. a. R. S. a. C. Newton (Ed.), Data Mining: Heuristic Approach, IEEE Idea Group Publishing (2002)
  • View Article
  • Google Scholar


• [14] S. Hettich, S.D. Bay, The UCI KDD Archive, Retrieved September, from the World Wide Web:http://kdd.ics.uci.edu. (2002)
  • Google Scholar


• [15] R. Shakerian, S. H. Kamali, M. Hedayati, M. Alipour, Comparative Study of Ant Colony Optimization and Particle Swarm optimization for Gris Scheduling, TJMCS , 3 (2011), 469-474.
  • Google Scholar


• [16] Rouhollah Maghsoudi, Arash Ghorbannia Delavar, Somayye Hoseyny, Rahmatollah Asgari, Yaghub Heidari , Representing the New Model for Improving K-Means Clustering Algorithm based on Genetic Algorithm, Journal of mathematics and computer Science(JMCS) , 2 (2011), 329 - 336.
  • Google Scholar