Genetic-based Pruning Technique for Ant-Miner Classification Algorithm

Hayder Naser Khraibet Al-Behadili (1), Ku Ruhana Ku-Mahamud (2), Rafid Sagban (3)
(1) Computer Science Department, Shatt Alarab University College, Basra,61001, Iraq
(2) School of Computing, Universiti Utara Malaysia, Kedah, 06010 Sintok, Kedah, Malaysia
(3) Department of Software, University of Babylon, Babylon,51002, Iraq
Fulltext View | Download
How to cite (IJASEIT) :
Al-Behadili, Hayder Naser Khraibet, et al. “Genetic-Based Pruning Technique for Ant-Miner Classification Algorithm”. International Journal on Advanced Science, Engineering and Information Technology, vol. 11, no. 1, Feb. 2021, pp. 304-11, doi:10.18517/ijaseit.11.1.10826.
Ant colony optimization (ACO) is a well-known algorithm from swarm intelligence that plays an essential role in obtaining rich solutions to complex problems with wide search space. ACO is successfully applied to different application problems involving rules-based classification through an ant-miner classifier. However, in the ant-miner classifier, rule-pruning suffers from the problem of nesting effect origins from the method of greedy Sequential Backward Selection (SBS) in term selection, thereby depriving the opportunity of obtaining a good pruned rule by adding/removing the terms during the pruning process. This paper presents an extension to the Ant-Miner, namely the genetic algorithm Ant-Miner (GA-Ant Miner), which incorporates the use of GA as a key aspect in the design and implementation of a new rule pruning technique. This pruning technique consists of three fundamental procedures: an initial population Ant-Miner, crossover to prune the rule, and mutation to diversify the pruned classification rule. The GA-Ant Miner performance is tested and compared with the most related ant-mining classifiers, including the original Ant-Miner, ACO/ PSO2, TACO-Miner, CAnt-Miner, and Ant-Miner with a hybrid pruner, across various public available UCI datasets. These datasets are varied in terms of instance number, feature size, class number, and the application domains. Overall, the performance results indicate that the GA-Ant Miner classifier outperforms the other five classifiers in the classification accuracy and model size. Furthermore, the experimental results using statistical test prove that GA-Ant Miner is the best classifier when considering the multi objectives (i.e., accuracy and model size ranks).

H. N. K. Al-behadili, “Intelligent Hypothermia Care System using Ant Colony Optimization for Rules Prediction,” J. Univ. Babylon, vol. 26, no. 2, pp. 47-56, 2018.

L. Yang, K. Li, W. Zhang, and Z. Ke, “Ant colony classification mining algorithm based on pheromone attraction and exclusion,” Soft Comput., pp. 1-13, 2016.

H. N. K. Al-Behadili, R. Sagban, and K. R. Ku-Mahamud, “Adaptive parameter control strategy for ant-miner classification algorithm,” Indones. J. Electr. Eng. Informatics, vol. 8, no. 1, pp. 149-162, 2020.

H. N. K. AL-Behadili, K. R. Ku-Mahamud, and R. Sagban, “Hybrid ant colony optimization and genetic algorithm for rule induction,” J. Comput. Sci., vol. 16, no. 7, pp. 1019-1028, 2020.

H. N. K. Al-behadili, K. R. Ku-Mahamud, and R. Sagban, “Hybrid Ant Colony Optimization and Iterated Local Search for Rules-Based Classification,” J. Theor. Appl. Inf. Technol., vol. 98, no. 04, pp. 657-671, 2020.

N. C and S. V, “A Study on Applications of Machine Learning Techniques in Data Mining,” Shodhshauryam, Int. Sci. Ref. Res. J., vol. 1, no. 3, pp. 31-34, 2005.

A. M. Jabbar, K. R. Ku-Mahamud, and R. Sagban, “An improved ACS algorithm for data clustering,” Indones. J. Electr. Eng. Comput. Sci., vol. 17, no. 3, pp. 1506-1515, 2020.

A. M. Jabbar and K. Ku-Mahamud, “Ant-based sorting and ACO-based clustering approaches: A review,” in In 2018 IEEE Symposium on Computer Applications & Industrial Electronics (ISCAIE), 2018, pp. 217-223.

A. M. Jabbar, R. Sagban, and K. R. Ku-Mahamud, “Balancing Exploration and Exploitation In ACS Algorithms for Data Clustering,” J. Theor. Appl. Inf. Technol., vol. 97, no. 16, pp. 4320-4333, 2019.

A. M. Jabbar, K. R. Ku-Mahamud, and R. Sagban, “Modified ACS Centroid Memory for Data Clustering,” J. Comput. Sci., vol. 15, no. 10, pp. 1439-1449, 2019.

H. N. K. Al-behadili, “Classification Algorithms for Determining Handwritten Digit,” Iraqi J. Electr. Electron. Eng., vol. 12, no. 1, pp. 96-102, 2016.

H. N. K. Al-behadili, K. R. Ku-Mahamud, and R. Sagban, “Ant colony optimization algorithm for rule-based classification: Issues and potential solutions,” J. Theor. Appl. Inf. Technol., vol. 96, no. 21, pp. 7139-7150, 2018.

H. N. K. Al-behadili, K. R. Ku-Mahamud, and R. Sagban, “Rule pruning techniques in the ant-miner classification algorithm and its variants: A review,” in 2018 IEEE Symposium on Computer Applications & Industrial Electronics (ISCAIE), 2018, pp. 78-84.

R. S. Parpinelli, H. S. Lopes, and A. A. Freitas, “Data mining with an ant colony optimization algorithm,” IEEE Trans. Evol. Comput., vol. 6, no. 4, pp. 321-332, 2002.

B. Venkatesh and J. Anuradha, “A Review of Feature Selection and Its Methods,” Cybern. Inf. Technol., vol. 19, no. 1, pp. 3-26, 2019.

Y. B. W. Wah, N. Ibrahim, H. A. Hamid, S. Abdul-Rahman, and S. Fong, “Feature selection methods: Case of filter and wrapper approaches for maximising classification accuracy,” Pertanika J. Sci. Technol., vol. 26, no. 1, pp. 329-340, 2018.

A. A. Abdoos, P. K. Mianaei, and M. R. Ghadikolaei, “Combined VMD-SVM based feature selection method for classification of power quality events,” Appl. Soft Comput. J., vol. 38, pp. 637-646, 2016.

H. N. K. Al-behadili, K. R. Ku-mahamud, and R. Sagban, “Annealing strategy for an enhance rule pruning technique in ACO-based rule classification,” Indones. J. Electr. Eng. Comput. Sci., vol. 16, no. 3, pp. 1499-1507, 2019.

R. Parpinelli, H. Lopes, and A. A. AFreitas, “Data Mining With an Ant Colony Optimization Algorithm,” IEEE Trans. Evol. Comput., vol. 47, no. 6 (4), pp. 321-332, 2002.

R. Saian and K. R. Ku-Mahamud, “Ant colony optimization for rule induction with simulated annealing for terms selection,” Proc. - 2012 14th Int. Conf. Model. Simulation, UKSim 2012, no. March 2012, pp. 33-38, 2012.

K. M. Salama and A. M. Abdelbar, “Extensions to the Ant-Miner classification rule discovery algorithm,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 6234 LNCS, pp. 167-178, 2010.

D. Dua and T. Karra, “UCI Machine Learning Repository,” Irvine, CA: University of California, School of Information and Computer Science, 2017. [Online]. Available:

F. Otero, A. A. Freitas, and C. G. Johnson, “cAnt-miner: An ant colony classification algorithm to cope with continuous attributes,” in International Conference on Ant Colony Optimization and Swarm Intelligence., 2008, pp. 48-59.

N. Holden and A. A. Freitas, “A Hybrid PSO/ACO Algorithm for Discovering Classification Rules in Data Mining,” J. Artif. Evol. Appl., vol. 2008, pp. 1-11, 2008.

K. Thangavel and P. Jaganathan, “Rule Mining Algorithm with a New Ant Colony Optimization Algorithm,” Int. Conf. Comput. Intell. Multimed. Appl. ICCIMA 2007, vol. 1, pp. 561-563, 2007.

S. Tripathy, S. Hota, and P. Satapathy, “MTACO-Miner : Modified Threshold Ant Colony Optimization Miner for Classification Rule Mining,” in Emerging Reserch in Computing, Information, Communication and Application, 2013, pp. 1-6.

A. Chan and A. Freitas, “A new classification-rule pruning procedure for an Ant Colony Algorithm,” in In International Conference on Artificial Evolution (Evolution Artificielle), 2006, vol. 3871 LNCS, pp. 25-36.

R. Robu, C. Vacar, N. Robu, and S. Holban, “A study on Ant Miner parameters,” in 6th International Conference on Information, Intelligence, Systems and Applications, 2016.

M. López-Ibí¡ñez, T. Stí¼tzle, and M. Dorigo, “Ant Colony Optimization: A Component-Wise Overview,” Bruxelles, Belgium, 2016.

M. L. Raymer, W. Punch, E. Goodman, L. Kuhn, and A. Jain, “Dimensionality reduction using genetic algorithms - Evolutionary Computation,” IEEE Trans. Evol. Comput., vol. 4, no. 2, pp. 164-171, 2000.

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
    2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
    3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).