Abstract
This paper presents an extension to Ant-Miner, named cAnt-Miner (Ant-Miner coping with continuous attributes), which incorporates an entropy-based discretization method in order to cope with continuous attributes during the rule construction process. By having the ability to create discrete intervals for continuous attributes “on-the-fly”, cAnt-Miner does not requires a discretization method in a preprocessing step, as Ant-Miner requires. cAnt-Miner has been compared against Ant-Miner in eight public domain datasets with respect to predictive accuracy and simplicity of the discovered rules. Empirical results show that creating discrete intervals during the rule construction process facilitates the discovery of more accurate and significantly simpler classification rules.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fayyad, U., Piatetsky-Shapiro, G., Smith, P.: From data mining to knowledge discovery: an overview. In: Fayyad, U., Piatetsky-Shapiro, G., Smith, P., Uthurusamy, R. (eds.) Advances in Knowledge Discovery & Data Mining, pp. 1–34. MIT Press, Cambridge (1996)
Witten, H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Freitas, A., Parpinelli, R., Lopes, H.: Ant colony algorithms for data mining. In: Encyclopedia of Info. Sci. & Tech., 2nd edn. (to appear, 2008)
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, pp. 191–208. Idea Group Publishing (2002)
Parpinelli, R., Lopes, H., Freitas, A.: Data mining with an ant colony optimization algorithm. IEEE Transactions on Evolutionary Computation 6(4), 321–332 (2002)
Quinlan, J.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)
Clark, P., Niblett, T.: The CN2 rule induction algorithm. Machine Learning 3(4), 261–283 (1989)
Chan, A., Freitas, A.: A new classification-rule pruning procedure for an ant colony algorithm. In: Talbi, E.-G., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds.) EA 2005. LNCS, vol. 3871, pp. 25–36. Springer, Heidelberg (2006)
Martens, D., Backer, M.D., Haesen, R., Vanthienen, J., Snoeck, M., Baesens, B.: Classification with ant colony optimization. IEEE Transactions on Evolutionary Computation 11(5), 651–665 (2007)
Stützle, T., Hoos, H.: MAX-MIN ant system. Future Generation Computer Systems 16(8), 889–914 (2000)
Galea, M., Shen, Q.: Simultaneous ant colony optimization algorithms for learning linguistic fuzzy rules. In: Agraham, A., Grosan, C., Ramos, V. (eds.) Swarm Intelligence in Data Mining, pp. 75–99. Springer, Heidelberg (2006)
Swaminathan, S.: Rule induction using ant colony optimization for mixed variable attributes. Master’s thesis, Texas Tech University (2006)
Chan, A., Freitas, A.: A new ant colony algorithm for multi-label classification with applications in bioinformatics. In: Proc. Genetic and Evolutionary Computation Conference (GECCO-2006), pp. 27–34 (2006)
Dougherty, J., Kohavi, R., Sahami, M.: Supervised and unsupervised discretization of continuous features. In: Machine Learning: Proceedings of the Twelfth Int. Conference on Artificial Intelligence, pp. 194–202. Morgan Kauffmann, San Francisco (1995)
Liu, H., Hussain, F., Tan, C., Dash, M.: Discretization: An enabling technique. Data Mining and Knowledge Discovery 6, 393–423 (2002)
Kohavi, R., Sahami, M.: Error-based and entropy-based discretization of continuous features. In: Proceedings of the 2nd International Conference Knowledge Discovery and Data Mining, pp. 114–119. AAAI Press, Menlo Park (1996)
Fayyad, U., Irani, K.: Multi-interval discretization of continuous-valued attributes for classification learning. In: Thirteenth International Joint Conference on Artifical Inteligence, pp. 1022–1027. Morgan Kaufmann, San Francisco (1993)
Asuncion, A., Newman, D.: UCI machine learning repository (2007) , http://www.ics.uci.edu/~mlearn/MLRepository.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Otero, F.E.B., Freitas, A.A., Johnson, C.G. (2008). cAnt-Miner: An Ant Colony Classification Algorithm to Cope with Continuous Attributes. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stützle, T., Winfield, A.F.T. (eds) Ant Colony Optimization and Swarm Intelligence. ANTS 2008. Lecture Notes in Computer Science, vol 5217. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87527-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-87527-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87526-0
Online ISBN: 978-3-540-87527-7
eBook Packages: Computer ScienceComputer Science (R0)