Authors: Leila Hamdad; Zakaria Ournani; Karima Benatchba; Ahcène Bendjoudi
Addresses: LCSI, Ecole Nationale Supérieure en Informatique (ESI), BP 68M, Oued Smar, El Harrach, Algeria ' Ecole Nationale Supérieure en Informatique (ESI), BP 68M, Oued Smar, El Harrach, Algeria ' LMCS, Ecole Nationale Supérieure en Informatique (ESI), BP 68M, Oued Smar, El Harrach, Algeria ' DTISI, CERIST Research Center, Algiers, Algeria
Abstract: Genetic algorithms (GA) are widely used in the literature to extract interesting association rules. However, they are time consuming mainly due to the growing size of databases. To speed up this process, we propose two parallel GAs (ARMGPU and ARM-CPU/GPU). In ARM-GPU, parallelism is used to compute the fitness which is the most time consuming task; while, ARM-CPU/GPU proposes a two-level-based parallel GA. In the first level, the different cores of the CPU execute a GAARM on a sub-population. The second level of parallelism is used to compute the fitness, in parallel, on GPU. To validate the proposed two parallel GAs, several tests were conducted to solve well-known large ARM instances. Obtained results show that our parallel algorithms outperform state-of-the-art exact algorithms (APRIORI and FP-GROWTH) and approximate algorithms (SEGPU and ME-GPU) in terms of execution time.
Keywords: association rules; parallel genetic algorithm; GPU; CPU.
International Journal of Computational Science and Engineering, 2020 Vol.22 No.2/3, pp.335 - 345
Received: 22 Jul 2019
Accepted: 26 Dec 2019
Published online: 18 May 2020 *