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
Otero, Fernando E.B.; Freitas, Alex A. (2016)
Publisher: MIT Press
Languages: English
Types: Article
Subjects: Q335
The vast majority of Ant Colony Optimization (ACO) algorithms for inducing classification rules use an ACO-based procedure to create a rule in an one-at-a-time fashion. An improved search strategy has been proposed in the cAnt-MinerPB algorithm, where an ACO-based procedure is used to create a complete list of rules (ordered rules)-i.e., the ACO search is guided by the quality of a list of rules, instead of an individual rule. In this paper we propose an extension of the cAnt-MinerPB algorithm to discover a set of rules (unordered rules). The main motivations for this work are to improve the interpretation of individual rules by discovering a set of rules and to evaluate the impact on the predictive accuracy of the algorithm. We also propose a new measure to evaluate the interpretability of the discovered rules to mitigate the fact that the commonly-used model size measure ignores how the rules are used to make a class prediction. Comparisons with state-of-the-art rule induction algorithms, support vector machines and the cAnt-MinerPB producing ordered rules are also presented.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • Bacardit, J., Burke, E., and Krasnogor, N. (2009). Improving the scalability of rule-based evolutionary learning. Memetic Computing, 1(1):55-67.
    • Clark, P. and Boswell, R. (1991). Rule Induction with CN2: Some Recent Improvements. In Machine Learning - Proceedings of the Fifth European Conference (EWSL-91), pages 151-163, Berlin. Springer.
    • Cohen, W. (1995). Fast effective rule induction. In Proceedings of the 12th International Conference on Machine Learning, pages 115-123, San Francisco, CA, USA. Morgan Kaufmann.
    • Demsˇar, J. (2006). Statistical Comparisons of Classifiers over Multiple Data Sets. Journal of Machine Learning Research, 7:1-30.
    • Fayyad, U., Piatetsky-Shapiro, G., and Smith, P. (1996). From data mining to knowledge discovery: an overview. In Fayyad, U., Piatetsky-Shapiro, G., Smith, P., and Uthurusamy, R., editors, Advances in Knowledge Discovery & Data Mining, pages 1-34, Cambridge, MA, USA. MIT Press.
    • Franco, M., Krasnogor, N., and Bacardit, J. (2012). Post-processing Operators for Decision Lists. In Genetic and Evolutionary Computation Conference (GECCO-2012), pages 847-854, New York, NY, USA. ACM Press.
    • Frank, E. and Witten, I. (1998). Generating Accurate Rule Sets Without Global Optimization. In Shavlik, J., editor, Proceedings of the Fifteenth International Conference on Machine Learning, pages 144-151, San Francisco, CA, USA. Morgan Kaufmann.
    • Freitas, A. (2013). Comprehensible classification models: a position paper. ACM SIGKDD Explorations, 15(1):1-10.
    • Freitas, A., Parpinelli, R., and Lopes, H. (2008). Ant colony algorithms for data classification. In Encyclopedia of Information Science and Technology, volume 1, pages 154-159. IGI Global, Hershey, PA, USA, 2nd edition.
    • Garc´ıa, S. and Herrera, F. (2008). An Extension on “Statistical Comparisons of Classifiers over Multiple Data Sets” for all Pairwise Comparisons. Journal of Machine Learning Research, 9:2677-2694.
    • Holden, N. and Freitas, A. (2008). A hybrid PSO/ACO algorithm for discovering classification rules in data mining. Journal of Artificial Evolution and Applications (JAEA), special issue on Particle Swarms: The Second Decade. 11 pages.
    • Huysmans, J., Dejaeger, K., Mues, C., Vanthienen, J., and Baesens, B. (2011). An empirical evaluation of the comprehensibility of decision table, tree and rule based predictive models. Decision Support Systems, 51:141-154.
    • Martens, D., Baesens, B., and Fawcett, T. (2011). Editorial survey: swarm intelligence for data mining. Machine Learning, 82(1):1-42.
    • Medland, M., Otero, F., and Freitas, A. (2012). Improving the cAnt-MinerPB Classification Algorithm. In Dorigo, M., Birattari, M., Blum, C., Christensen, A. L., Engelbrecht, A. P., Groß, R., and St u¨tzle, T., editors, Swarm Intelligence, volume 7461 of Lecture Notes in Computer Science, pages 73-84, Berlin. Springer.
    • Nalini, C. and Balasubramanie, P. (2008). Discovering Unordered Rule Sets for Mixed Variables Using an Ant-Miner Algorithm. Data Science Journal, 7:76-87.
    • Olmo, J., Romero, J., and Ventura, S. (2011). Using Ant Programming Guided by Grammar for Building Rule-Based Classifiers. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 41:1585-1599.
    • Olmo, J., Romero, J., and Ventura, S. (2012). Classification rule mining using ant programming guided by grammar with multiple pareto fronts. Soft Computing, 16:2143- 2163.
    • Otero, F. and Freitas, A. (2013). Improving the Interpretability of Classification Rules Discovered by an Ant Colony Algorithm. In Genetic and Evolutionary Computation Conference (GECCO-2013), pages 73-80, New York, NY, USA. ACM Press.
    • Otero, F., Freitas, A., and Johnson, C. (2008). cAnt-Miner: an ant colony classification algorithm to cope with continuous attributes. In Dorigo, M., Birattari, M., Blum, C., Clerc, M., St u¨tzle, T., and Winfield, A., editors, Proceedings of the 6th International Conference on Swarm Intelligence (ANTS 2008), Lecture Notes in Computer Science 5217, pages 48-59. Springer-Verlag.
    • Otero, F., Freitas, A., and Johnson, C. (2009). Handling continuous attributes in ant colony classification algorithms. In Proceedings of the 2009 IEEE Symposium on Computational Intelligence in Data Mining (CIDM 2009), pages 225-231. IEEE.
    • Otero, F., Freitas, A., and Johnson, C. (2013). A New Sequential Covering Strategy for Inducing Classification Rules With Ant Colony Algorithms. IEEE Transactions on Evolutionary Computation, 17(1):64-76.
    • Parpinelli, R., Lopes, H., and Freitas, A. (2002). Data mining with an ant colony optimization algorithm. IEEE Transactions on Evolutionary Computation, 6(4):321-332.
    • Piatetsky-Shapiro, G. and Frawley, W. (1991). Knowledge Discovery in Databases. AAAI Press. 540 pages.
    • Quinlan, J. (1996). Improved Use of Continuous Attributes in C4.5. Artificial Intelligence Research, 7:77-90.
    • Quinlan, J. R. (1993). C4.5: programs for machine learning. Morgan Kaufmann, San Francisco, CA, USA. 316 pages.
    • Schwabacher, M. and Langley, P. (2001). Discovering communicable scientific knowledge from spatio-temporal data. In Proceedings of 18th International Conference on Machine Learning (ICML-2001), pages 489-496, San Francisco, CA, USA. Morgan Kaufmann.
    • Smaldon, J. and Freitas, A. (2006). A new version of the ant-miner algorithm discovering unordered rule sets. In Proc. Genetic and Evolutionary Computation Conference (GECCO 2006), pages 43-50, New York, NY, USA. ACM Press.
    • Tsumoto, S. (2000). Clinical knowledge discovery in hospital information systems: two case studies. In Proceedings of European Conference on Principles and Practice of Knowledge Discovery and Data Mining (PKDD-2000), pages 652-656, Berlin. Springer.
    • Vapnik, V. N. (2000). The Nature of Statistical Learning Theory. Springer, 2nd edition. 314 pages.
    • Witten, H. and Frank, E. (2011). Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann, 3rd edition. 664 pages.
  • No related research data.
  • Discovered through pilot similarity algorithms. Send us your feedback.

Share - Bookmark

Cite this article