Open Access Open Access  Restricted Access Subscription or Fee Access

Scientific Understanding, Experimental Analysis and a Survey on Evolution of Classification Rule Mining Based on Ant Colony Optimization

Nidhi Shah, Amit Ganatra, C.K. Bhensdadia, Y.P. Kosta

Abstract


Given the explosive rate of data deposition on the web; classification has become a complex and dynamic phenomenon. As classification complexity is continuing to grow, so is the need in direct proportion to designing and developing data mining algorithms & techniques. Classification is the most commonly applied data mining technique, a process of finding a set of models or functions that describes and distinguishes data classes, for the purpose of using it – so classification is a specialist with specialized skills, which is moving toward universality. A classification problem is considered as a supervised learning problem. The aim of the classification task is to discover a kind of relationship between the attributes (input) and class (output), so that the discovered knowledge can be used to predict the class of a new unknown object. Classification of the records or data is done based on the classification rules. Ant colony optimization is a method that derives its inspiration from real ants that forage for food by selecting the shortest path from multiple possible paths available to reach food. Thus merging the concept of Ant Colony Optimization (ACO) with data mining brings in a new approach to designing classification rule that will be helpful in extraction of information for a specialized dataset. In this paper a survey is done on Ant-miner algorithm for classification Rule extraction. The Ant miner algorithm extract classification rule from data using if-then-else pattern; similar to other traditional algorithm available for classification task or purposes. Extraction of classification Rule from data is an important task of data mining. We present, detailed description about the algorithm available for classification rule mining using Ant colony optimization. Variations to the ant colony based an Ant-miner algorithm is discussed along with the comparison of the algorithms with critical parameters like predictive accuracy, No. of Rules Discovered, No. of terms per No. of rules Discovered, using different data sets. Hence the paper will help to study various ant miner algorithms and comparison carried out will help the data miner to select and use algorithm according to need based on the specialized properties associated with the algorithm.

Keywords


Ant Colony Optimization (ACO), Classification, Data mining

Full Text:

PDF

References


R.S.Parnelli, H.S.Lopes and A.A.Freitas, “Data Mining with an Ant Colony Optimization Algorithm”, IEEE Trans. On Evolutinary Computation, special issue on Ant colony Algorithm, 6(4),pp 321-332,Aug 2002.

Bo,L., Abbas, H.A, Kay B, “Classification Rule Discovery With an Ant Colony optimization”, In International Conference on Intelligent Agent Technology,2003.IAT 2003. IEEE October 13-1-2003 ,pp 83-88(2003).

Fernando E.B. Otero, Alex A. Freitas, and Colin G. Johnson, “cAnt-Miner: An Ant Colony Classification Algorithm to Cope with Continuous Attributes” in Springer-Verlag Berlin, Heidelberg 2008.

K .Thangavel.,P. Jaganathan, “Rule Mining with a new Ant Colony optimization Algorithm Rules”, In:2007 IEEE International Conference on Granular Computing ,pp 135-140(2007)

Bo Liu , Hussein A.Abbass, Bob McKay, “Density_based Heuristic for Rule Discovery with Ant_Miner”, The 6th Australia-Japan Joint Workshop on Intelligent and Evolutionary System,2002, page 180-184.

Fayyad, Usama; Gregory Piatetsky-Shapiro, and Padhraic Smyth (1996). “From Data Mining to Knowledge to Discovery in Databases”, In American Association for Artificial Intelligence, Retrieved 2008-12-17.

Parpinelli, R., Lopes, H., Freitas, A., “An ant colony algorithm for classification rule discovery”, In Abbass, H., Sarker, R., Newton, C., eds.: Data Mining: a Heuristic Approach, Idea Group Publishing (2002) 191–208.

Ziqiang Wang ,Boqin Feng, “Classification Rule Mining with an Improved Ant Colony Algorithm”, In AI 2004: Advances in Artificial

Intelligence, 17th Australian Joint Conference on Artificial Intelligence Cairns,Australia,December 2004 proceedings.

R. Kohavi and M. Sahami, “Error-based and entropy-based discretization of continuous features,” in Proc. 2nd Int. Conf. Knowledge Discovery and Data Mining, Menlo Park, CA, 1996, pp. 114–119.

J. R. Quinlan , “C4.5: Programs for Machine Learning.”, San Mateo, CA: Morgan Kaufmann, 1993.

Asuncion, A., Newman, D.: UCI machine learning repository,

http://www.ics.uci.edu/_mlearn/MLRepository.html.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.