GPU-based Bees Swarm Optimization for Association Rules Mining
| dc.citation.issue | 00 | fr_FR |
| dc.citation.volume | 00 | fr_FR |
| dc.contributor.author | Djenouri, Youcef | |
| dc.contributor.author | Bendjoudi, Ahcène | |
| dc.contributor.author | Mehdi, Malika | |
| dc.contributor.author | Nouali-Taboudjemat, Nadia | |
| dc.contributor.author | Habbas, Zineb | |
| dc.date.accessioned | 2014-12-15T14:09:01Z | |
| dc.date.available | 2014-12-15T14:09:01Z | |
| dc.date.issued | 2014 | |
| dc.description.abstract | Association Rules Mining (ARM) is a well-known combinatorial optimization problem aiming at extracting relevant rules from given large scale data sets. According to the state of the art, the bio-inspired methods proved their efficiency by generating acceptable solutions in a reasonable time when dealing with small and medium size instances. Unfortunately, to cope with large instances such as the webdocs benchmark, these methods require more and more powerful processors and are time expensive. Nowadays, computing power is no longer a real issue. It can be provided by the power of emerging technologies such as GPUs that are massively multi-threaded processors. In this paper, we investigate the use of GPUs to speed up the computation. We propose two GPU-based bees swarm algorithms for association rules mining (SE-GPU and ME-GPU). SE-GPU aims at evaluating one rule at a time where each thread is associated with one transaction, whereas ME-GPU evaluates multiple rules in parallel on GPU where each thread is associated with several transactions. To validate our approaches, the two algorithms have been executed to solve well-known large ARM instances. Real experiments have been carried out on an Intel Xeon 64 bit quad-core processor E5520 coupled to an Nvidia Tesla C2075 GPU device. The results show that our approaches improve the execution time up to x100 over the sequential mono-core BSO-ARM algorithm. Moreover, the proposed approaches have been compared with CPU multi-core ones (1 to 8 cores). The results show that they are faster than the multi-core versions what ever the number of used cores. | fr_FR |
| dc.identifier.uri | http://dl.cerist.dz/handle/CERIST/701 | |
| dc.publisher | Springer | fr_FR |
| dc.relation.ispartof | The Journal of Supercomputing | fr_FR |
| dc.rights.holder | Springer | fr_FR |
| dc.structure | Calcul Pervasif et Mobile | fr_FR |
| dc.subject | Bees Swarm Optimization (BSO) | fr_FR |
| dc.subject | Association Rule Mining (ARM) | fr_FR |
| dc.subject | Massively Parallel Algorithms | fr_FR |
| dc.subject | GPU Computing | fr_FR |
| dc.title | GPU-based Bees Swarm Optimization for Association Rules Mining | fr_FR |
| dc.type | Article |