Rule pruning techniques in the ant-miner classification algorithm and its variants: A review

• Main Authors: Al-Behadili, Hayder Naser Khraibet, Ku-Mahamud, Ku Ruhana, Sagban, Rafid
• Format: Conference or Workshop Item
• Language: English
• Published: 2018
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://repo.uum.edu.my/24425/1/SCAIE%202018%2078%2084.pdf; http://repo.uum.edu.my/24425/; http://doi.org/10.1109/ISCAIE.2018.8405448

Rule-based classification is considered an important task of data classification.The ant-mining rule-based classification algorithm, inspired from the ant colony optimization algorithm, shows a comparable performance and outperforms in some application domains to the existing methods in the literature.One problem that often arises in any rule-based classification is the overfitting problem. Rule pruning is a framework to avoid overfitting.Furthermore, we find that the influence of rule pruning in ant-miner classification algorithms is equivalent to that of local search in stochastic methods when they aim to search for more improvement for each candidate solution.In this paper, we review the history of the pruning techniques in ant-miner and its variants.These techniques are classified into post-pruning, pre-pruning and hybrid-pruning.In addition, we compare and analyse the advantages and disadvantages of these methods. Finally, future research direction to find new hybrid rule pruning techniques are provided.