mailto:uumlib@uum.edu.my 24x7 Service; AnyTime; AnyWhere

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

Al-Behadili, Hayder Naser Khraibet and Ku-Mahamud, Ku Ruhana and Sagban, Rafid (2018) Rule pruning techniques in the ant-miner classification algorithm and its variants: A review. In: 2018 IEEE Symposium on Computer Applications & Industrial Electronics (ISCAIE), 28-29 April 2018, Penang, Malaysia, Malaysia. (Unpublished)

[thumbnail of SCAIE 2018 78 84.pdf] PDF
Restricted to Registered users only

Download (1MB)

Abstract

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.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Rule based classification; Ant colony optiomazation; Rule Induction ; Knowledge discovery.
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: School of Computing
Depositing User: Mrs. Norazmilah Yaakub
Date Deposited: 15 Jul 2018 08:28
Last Modified: 15 Jul 2018 08:28
URI: https://repo.uum.edu.my/id/eprint/24425

Actions (login required)

View Item View Item