Abstract
Ant Miner algorithms are used for the classification task of data mining. This paper proposes a new version of Ant Miner algorithm called CAnt Miner that considers compatibility between the attributes, when constructing a rule. In addition to a new heuristic function based on compatibility among attributes, we also introduce a strategy to dynamically stop adding terms in the rule antecedent part instead of using a user specified threshold that specifies when to stop adding terms. We compare the performance of proposed approach with other Ant Miner versions and C4.5 in nine public domain data set. The experiment results show that the proposed approach achieves higher accuracy rate then other approaches.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
