Improving the interpretability of classification rules discovered by an ant colony algorithm
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
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 motivation for discovering a set of rules is to improve the interpretation of individual rules and 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 and the cAnt-MinerPB producing ordered rules are also presented.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Huysmans, J., Dejaeger, K., Mues, C., Vanthienen, J., & Baesens, B. (2011) · Decision Support Systems · doi:10.1016/j.dss.2010.12.003 · Cited by 425 · cited 1×
“An empirical study tested the assumption that smaller models are more comprehensible to users [9].”
Background
Research works printed but not linked: 23
- Clark P., 1991, Machine Learning -- Proceedings of the Fifth European Conference (EWSL-91), 151
- 10.1016/B978-1-55860-377-6.50023-2 · DOI · Paper page
- J., 2006, Statistical Comparisons of Classifiers over Multiple Data Sets, Journal of Machine Learning Research, 7, 1
- Fayyad U., 1996, Advances in Knowledge Discovery & Data Mining, 1
- 10.5555/645527.657305 · doi:10.5555/645527.657305
- Freitas A., 2008, Encyclopedia of Information Science and Technology, 154
- García S., 2008, An Extension on "Statistical Comparisons of Classifiers over Multiple Data Sets" for all Pairwise Comparisons, Journal of Machine Learning Research, 9, 2677
- Lavesson H. A. N., 2011, Proceedings of the 11th Scandinavian Conference on Artificial Intelligence (SCAI), 11
- 10.1016/S0933-3657(98)00062-1 · DOI · Paper page
- 10.1007/s10994-010-5216-5 · DOI · Paper page
- 10.1007/978-3-642-32650-9_7 · doi:10.1007/978-3-642-32650-9_7
- 10.2481/dsj.7.76 · doi:10.2481/dsj.7.76
- 10.1109/TSMCB.2011.2157681 · DOI
- 10.1007/s00500-012-0883-8 · DOI
- 10.1109/TEVC.2012.2185846 · DOI
- 10.1109/TEVC.2002.802452 · DOI
- Piatetsky-Shapiro G., 1991, AAAI Press
- 10.5555/1622737.1622742 · doi:10.5555/1622737.1622742
- Quinlan J. R., 1993, Morgan Kaufmann Publishers Inc.
- Schwabacher M., 2001, Proceedings of 18th International Conference on Machine Learning (ICML-2001), 489
- 10.1145/1143997.1144004 · doi:10.1145/1143997.1144004
- 10.5555/645804.669682 · doi:10.5555/645804.669682
- H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann 2nd edition 2005. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann 2nd edition 2005.
Cited by
Comprehensible classification models: a position paper
Freitas, A. A. (2014) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2594473.2594475 · Cited by 572
Self-citationA Survey of Methods for Explaining Black Box Models
Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., & Pedreschi, D. (2019) · ACM Computing Surveys · doi:10.1145/3236009 · Cited by 629
“In this kind of model, a more honest measure could be the average number of conditions evaluated to classify a set of test records [84].”
BackgroundExplainable decision forest: Transforming a decision forest into an interpretable tree
Sagi, O., & Rokach, L. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.03.013 · Cited by 189
Metadata
- Authors
- Otero, F. E. B., & Freitas, A. A.
- Venue
- Proceedings of the 15th annual conference on Genetic and evolutionary computation
- Publisher
- ACM
- Published
- 2013-07-06
- Pages
- 73-80
- OpenAlex
- W2005297674
- Cited by
- 34
- References
- 1
- FWCI
- 4.30
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Improving the interpretability of classification rules discovered by an ant colony algorithm. https://app.cochat.ai/papers/10.1145/2463372.2463382
- The paper
- Otero, F. E. B., & Freitas, A. A. (2013). Improving the interpretability of classification rules discovered by an ant colony algorithm. Proceedings of the 15th annual conference on Genetic and evolutionary computation. https://doi.org/10.1145/2463372.2463382
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.