research-article

A study of different quality evaluation functions in the cAnt-Miner(PB) classification algorithm

Authors:

Matthew Medland,

Fernando OteroAuthors Info & Claims

GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computation

Pages 49 - 56

https://doi.org/10.1145/2330163.2330171

Published: 07 July 2012 Publication History

Get Access

Abstract

Ant colony optimization (ACO) algorithms for classification in general employ a sequential covering strategy to create a list of classification rules. A key component in this strategy is the selection of the rule quality function, since the algorithm aims at creating one rule at a time using an ACO-based procedure to search the best rule. Recently, an improved strategy has been proposed in the cAnt-Miner_PB algorithm, where an ACO-based procedure is used to create a complete list of rules instead of individual rules. In the cAnt-Miner_PB algorithm, the rule quality function has a smaller role and the search is guided by the quality of a list of rules. This paper sets out to determine the effect of different rule and list quality functions in terms of both predictive accuracy and size of the discovered model in cAnt-Miner_PB. The comparative analysis is performed using 12 data sets from the UCI Machine Learning repository and shows that the effect of the rule quality functions in cAnt-Miner_PB is different from the results previously presented in the literature.

References

[1]

J. Demšar. Statistical Comparisons of Classifiers over Multiple Data Sets. Machine Learning Research, 7:1--30, 2006.

Digital Library

Google Scholar

[2]

M. Dorigo and T. Stüzle. Ant Colony Optimization. The MIT Press, 2004.

Digital Library

Google Scholar

[3]

A. Frank and A. Asuncion. UCI machine learning repository, 2010.

Google Scholar

[4]

J. Fürnkranz and P. Flach. ROC 'n' Rule Learning - Towards a Better Understanding of Covering Algorithms. Machine Learning, 58:39--77, 2005.

Digital Library

Google Scholar

[5]

S. García and F. Herrera. An Extension on 'Statistical Comparisons of Classifiers over Multiple Data Sets' for all Pairwise Comparisons. Machine Learning Research, 9:2677--2694, 2008.

Google Scholar

[6]

F. Janssen and J. Fürnkranz. On the quest for optimal rule learning heuristics. Machine Learning, 78:343--379, 2010.

Digital Library

Google Scholar

[7]

H. S. Lopes, M. S. Coutinho, and W. C. Lima. An evolutionary approach to simulate cognitive feedback learning in medical domain. In E. Sanchez, T. Shibata, and L. A. Zadeh, editors, Genetic Algorithms and Fuzzy Logic Systems, volume 7, pages 193--207. 1997.

Crossref

Google Scholar

[8]

D. Martens, B. Baesens, and T. Fawcett. Editorial survey: swarm intelligence for data mining. Machine Learning, 82:1--42, Jan 2011.

Digital Library

Google Scholar

[9]

D. Martens, M. De Backer, R. Haesen, J. Vanthienen, M. Snoeck, and B. Baesens. Classification with ant colony optimization. Evolutionary Computation, IEEE Transactions on, 11(5):651--665, Oct 2007.

Digital Library

Google Scholar

[10]

F. Otero, A. Freitas, and C. Johnson. A new sequential covering strategy for inducing classification rules with ant colony algorithms. To appear in IEEE Transactions on Evolutionary Computation, 2012.

Google Scholar

[11]

R. Parpinelli, H. Lopes, and A. Freitas. Data mining with an ant colony optimization algorithm. Evolutionary Computation, IEEE Transactions on, 6(4):321--332, Aug 2002.

Digital Library

Google Scholar

[12]

K. Salama and A. Abdelbar. Exploring different rule quality evaluation functions in aco-based classification algorithms. In Swarm Intelligence (SIS), 2011 IEEE Symposium on, pages 1--8, Apr 2011.

Crossref

Google Scholar

[13]

I. H. Witten, E. Frank, and M. A. Hall. Data Mining: Practical Machine Learning Tools and Techniques. 3rd edition, 2011.

Digital Library

Google Scholar

Cited By

View all

Chennupati GAzad RRyan CArnold D(2014)Predict the performance of GE with an ACO based machine learning algorithmProceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation10.1145/2598394.2609860(1353-1360)Online publication date: 12-Jul-2014
https://dl.acm.org/doi/10.1145/2598394.2609860
Chennupati GRyan CAzad RArnold D(2014)Predict the success or failure of an evolutionary algorithm runProceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation10.1145/2598394.2598471(131-132)Online publication date: 12-Jul-2014
https://dl.acm.org/doi/10.1145/2598394.2598471
Salama KFreitas AAlba E(2013)Evaluating the use of different measure functions in the predictive quality of ABC-minerProceedings of the 15th annual conference companion on Genetic and evolutionary computation10.1145/2464576.2464580(15-16)Online publication date: 6-Jul-2013
https://dl.acm.org/doi/10.1145/2464576.2464580
Show More Cited By

Index Terms

A study of different quality evaluation functions in the cAnt-Miner(PB) classification algorithm
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
      1. Heuristic function construction

Recommendations

Improving the interpretability of classification rules discovered by an ant colony algorithm: Extended results

Most ant colony optimization ACO algorithms for inducing classification rules use a ACO-based procedure to create a rule in a one-at-a-time fashion. An improved search strategy has been proposed in the cAnt-Miner<inline-formula><inline-graphic xlink="...
Improving the interpretability of classification rules discovered by an ant colony algorithm
GECCO '13: Proceedings of the 15th annual conference on Genetic and evolutionary computation

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 ...
Hybrid Ant Colony Optimization and Simulated Annealing for Rule Induction
EMS '11: Proceedings of the 2011 UKSim 5th European Symposium on Computer Modeling and Simulation

This paper proposes a hybrid of ant colony optimization and simulated annealing for rule induction. The hybrid algorithm is part of the sequential covering algorithm which is the commonly used algorithm to extract classification rules directly from ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computation

July 2012

1396 pages

ISBN:9781450311779

DOI:10.1145/2330163

Editor:
Terence Soule
University of Idaho, USA
,
General Chair:
Jason H. Moore
Dartmouth College, USA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

GECCO '12

Sponsor:

SIGEVO

GECCO '12: Genetic and Evolutionary Computation Conference

July 7 - 11, 2012

Pennsylvania, Philadelphia, USA

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
113
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)1

Reflects downloads up to 22 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chennupati GAzad RRyan CArnold D(2014)Predict the performance of GE with an ACO based machine learning algorithmProceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation10.1145/2598394.2609860(1353-1360)Online publication date: 12-Jul-2014
https://dl.acm.org/doi/10.1145/2598394.2609860
Chennupati GRyan CAzad RArnold D(2014)Predict the success or failure of an evolutionary algorithm runProceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation10.1145/2598394.2598471(131-132)Online publication date: 12-Jul-2014
https://dl.acm.org/doi/10.1145/2598394.2598471
Salama KFreitas AAlba E(2013)Evaluating the use of different measure functions in the predictive quality of ABC-minerProceedings of the 15th annual conference companion on Genetic and evolutionary computation10.1145/2464576.2464580(15-16)Online publication date: 6-Jul-2013
https://dl.acm.org/doi/10.1145/2464576.2464580
Salama KFreitas A(2013)Investigating the impact of various classification quality measures in the predictive accuracy of ABC-Miner2013 IEEE Congress on Evolutionary Computation10.1109/CEC.2013.6557846(2321-2328)Online publication date: Jun-2013
https://doi.org/10.1109/CEC.2013.6557846

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Improving the interpretability of classification rules discovered by an ant colony algorithm: Extended results

Improving the interpretability of classification rules discovered by an ant colony algorithm

Hybrid Ant Colony Optimization and Simulated Annealing for Rule Induction