Abstract
Ant Colony Optimisation (ACO) has been successfully applied to the classification task of data mining in the form of Ant-Miner. A new extension of Ant-Miner, called cAnt-MinerPB, uses the ACO procedure in a different fashion. The main difference is that the search in cAnt-MinerPB is optimised to find the best list of rules, whereas in Ant-Miner the search is optimised to find the best individual rule at each step of the sequential covering, producing a list of best rules. We aim to improve cAnt-MinerPB in two ways, firstly by dynamically finding the rule quality function which is used while the rules are being pruned, and secondly improving the rule-list quality function which is used to guide the search. We have found that changing the rule quality function has little effect on the overall performance, but that by improving the rule-list quality function we can positively affect the discovered lists of 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
Demšar, J.: Statistical Comparisons of Classifiers over Multiple Data Sets. JMLR 7, 1–30 (2006)
Dorigo, M., Stüzle, T.: Ant Colony Optimization. The MIT Press (2004)
Fayyad, U., Piatetsky-Shapiro, G., Smith, P.: From data mining to knowledge discovery: an overview. In: Advances in Knowledge Discovery & Data Mining, pp. 1–34. MIT Press (1996)
Frank, A., Asuncion, A.: UCI Machine Learning Repository (2010), http://archive.ics.uci.edu/ml
Fürnkranz, J., Flach, P.: ROC ‘n’ Rule Learning—Towards a Better Understanding of Covering Algorithms. Machine Learning 58, 39–77 (2005)
GarcÃa, S., Herrera, F.: An Extension on ‘Statistical Comparisons of Classifiers over Multiple Data Sets’ for all Pairwise Comparisons. JMLR 9, 2677–2694 (2008)
Janssen, F., Fürnkranz, J.: On the quest for optimal rule learning heuristics. Machine Learning 78, 343–379 (2010)
Martens, D., Baesens, B., Fawcett, T.: Editorial survey: swarm intelligence for data mining. Machine Learning 82, 1–42 (2011)
Otero, F., Freitas, A., Johnson, C.: A New Sequential Covering Strategy for Inducing Classification Rules with Ant Colony Algorithms. To Appear in IEEE Trans. on Evolutionary Computation (2012)
Parpinelli, R., Lopes, H., Freitas, A.: Data Mining with an Ant Colony Optimization Algorithm. IEEE Trans. on Evolutionary Computation 6(4), 321–332 (2002)
Quinlan, J.R.: C4.5: Programs for Machine Learning. Kaufmann Publishers Inc., San Francisco (1993)
Salama, K., Abdelbar, A.: Exploring Different Rule Quality Evaluation Functions in ACO-based Classification Algorithms. In: IEEE Symposium on Swarm Intelligence (SIS), pp. 1–8 (2011)
Witten, I., Frank, E., Hall, M.: Data Mining: Practical Machine Learning Tools and Techniques, 3rd edn. Morgan Kaufmann (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Medland, M., Otero, F.E.B., Freitas, A.A. (2012). Improving the cAnt-MinerPB Classification Algorithm. In: Dorigo, M., et al. Swarm Intelligence. ANTS 2012. Lecture Notes in Computer Science, vol 7461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32650-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-32650-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32649-3
Online ISBN: 978-3-642-32650-9
eBook Packages: Computer ScienceComputer Science (R0)