Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Medland, Matthew; Otero, Fernando E.B.; Freitas, Alex A. (2012)
Publisher: Springer Berlin Heidelberg
Languages: English
Types: Unknown
Subjects: QA76
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.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • 1. Demˇsar, J.: Statistical Comparisons of Classifiers over Multiple Data Sets. JMLR 7, 1-30 (2006)
    • 2. Dorigo, M., Stu¨zle, T.: Ant Colony Optimization. The MIT Press (2004)
    • 3. 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)
    • 4. Frank, A., Asuncion, A.: UCI Machine Learning Repository (2010), http://archive.ics.uci.edu/ml
    • 5. Fu¨rnkranz, J., Flach, P.: ROC 'n' Rule Learning-Towards a Better Understanding of Covering Algorithms. Machine Learning 58, 39-77 (2005)
    • 6. 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)
    • 7. Janssen, F., Fu¨rnkranz, J.: On the quest for optimal rule learning heuristics. Machine Learning 78, 343-379 (2010)
    • 8. Martens, D., Baesens, B., Fawcett, T.: Editorial survey: swarm intelligence for data mining. Machine Learning 82, 1-42 (2011)
    • 9. 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)
    • 10. Parpinelli, R., Lopes, H., Freitas, A.: Data Mining with an Ant Colony Optimization Algorithm. IEEE Trans. on Evolutionary Computation 6(4), 321-332 (2002)
    • 11. Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1993)
    • 12. 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)
    • 13. Witten, I., Frank, E., Hall, M.: Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann, 3rd edn. (2011)
  • No related research data.
  • Discovered through pilot similarity algorithms. Send us your feedback.

Share - Bookmark

Cite this article