Impact of Genetic Algorithms Operators on Association Rules Extraction
In this paper we study the impact of GAs’ components such as encoding, different crossover, mutation and replacement strategies on the number of extracted association rules and their quality. Moreover, we propose a strategy to manage the population. The later is organized in classes where each one encloses same size rules. Each class can be seen as a population on which a GA is applied. All tests are conducted on two types of benchmarks : synthetic and real ones of different sizes.
Association rules, Genetic Algorithm, Michigan Algorithm, Pittsburg Algorithm, Apriori Algorithm
Showing items related by title, author, creator and subject.
Bendjoudi, Ahcène; Melab, Nouredine; Talbi, El-GhazaliIn : International Journal of Grid and Utility Computing, (Inderscience, 2009)Solving optimally large instances of combinatorial optimisation problems using Branch and Bound (B&B) algorithms is CPU-time intensive and requires a large number of computational resources. To harness such huge amount of resources Peer-to-Peer (P2P) communications must be allowed between resources, and adaptive load ...
Belhoul, Yacine; Yahiaoui, SaïdIn : INFORMATION PROCESSING LETTERS, (ELSEVIER SCIENCE, 2013-05)We propose a self-stabilizing distributed algorithm for the minimal global powerful alliance set problem in an arbitrary graph. Then, we give self-stabilizing algorithms for some generalizations of the problem. Using an unfair distributed scheduler, the proposed algorithms converge in O (mn) moves starting from an ...
Bendjoudi, Ahcène; Melab, Nouredine; Talbi, El-GhazaliIn : Journal of Parallel Distributed Computing (JPDC), (Elsevier, 2012)Well-suited to embarrassingly parallel applications, the master–worker (MW) paradigm has largely and successfully used in parallel distributed computing. Nevertheless, such a paradigm is very limited in scalability in large computational grids. A natural way to improve the scalability is to add a layer of masters between ...