Modified Meerkat Clan Algorithm for Association Rules Mining

Abstract

Association Rules Mining (ARM) forms one of the important data mining techniques. The classical methods that were previously worked on by researchers have become ineffective to deal with the steady growth of databases, which prompted us to use the mining process for association rules based on metahuristic, and in our work all the correct rules will extracted, and mining is not limited to high-quality rules. Swarm intelligence based is one of these methods. In this paper, Modified Meerkat Clan for Association Rules Mining (MCC-ARM) has been proposed. Basically, the proposed algorithm depends on Meerkat Clan Algorithm (MCA). The greatest benefit is the diversity of candidate solutions in MCA. In our work the rules will represented using two methods which are borrowed from the genetic algorithm; in the first one each group of rules refers to object in society which is called Pittsburgh; while the second one each rule refers to an object in society which is called Michigan. The proposed algorithm aims to inspect for the maximum possible number of correct association rules. The so-called algorithm follows the approach of defining the effective search area, which depends on a main random mechanism to lead the algorithm in extracting alternative rules and avoiding total solutions from being guided by the same rule, and this led to a great deal of diversity. In addition, the MCC-ARM uses condensation method in the adjacency search process to prevent the algorithm from falling into the local mode. In order to prove their efficiency, it should be applied on four reliable datasets (i.e. Zoo, German Credit, Primary Tumor and Chess). The enhancement brought about by the proposed algorithm has obtained two crucial factors, namely on the number of correct rules and quality fitness value.

Keywords

• Association Rules Mining, Bees Algorithm, Genetic Association Rules, Meerkat Clan Algorithm, Vicinity Space