© 2018 This paper investigates the use of GPU (Graphics Processing Unit) in improving the bees swarm optimization metaheuristic performance for solving the association rule mining problem. Although this metaheuristic proved its effectiveness, it requires huge computational resource when considering big databases for mining. To overcome this limitation, we develop in this paper a GPU-based Bees Swarm Optimization Miner (GBSO-Miner) where the GPU is used as a co-processor to compute the CPU-time intensive steps of the algorithm. Unlike state-of-the-art GPU-based ARM methods, all BSO steps including the determination of search area, the local search, the evaluation, and the dancing are performed on GPU. A mapping method between the data input ...
This thesis deals with a population based stochastic optimization technique PSO (Particle Swarm Opti...
As of 2012, the world creates 2.5 quintillion bytes of data every day. Much of this data generated i...
International audienceBranch-and-Bound (B&B) algorithms are time intensive tree-based exploration me...
© 2018 This paper investigates the use of GPU (Graphics Processing Unit) in improving the bees swarm...
International audienceAssociation rules mining (ARM) is a well-known combinatorial optimization prob...
We explore in this paper the application of bioinspired approaches to the association rules mining (...
Artificial Bee Colony (ABC) optimization and k-means algorithm are popularly used in data clustering...
This paper deals with exploration and mining of association rules in big data, with the big challeng...
Inspired by the collective behavior of natural swarm, swarm intelligence algorithms (SIAs) have been...
Swarm intelligence algorithms have been widely used to solve difficult real world problems in both a...
There are many combinatorial optimization problems such as traveling salesman problem, quadratic-ass...
Graph Pattern Mining (GPM) extracts higher-order information in a large graph by searching for small...
A* search is a fundamental topic in artificial intelligence. Recently, the general purpose computat...
Reducts can be used to discern all discernible objects from the original information system. In orde...
This paper propose a parallel Apriori algorithm based on GPU (GPUApriori) for frequent itemsets mini...
This thesis deals with a population based stochastic optimization technique PSO (Particle Swarm Opti...
As of 2012, the world creates 2.5 quintillion bytes of data every day. Much of this data generated i...
International audienceBranch-and-Bound (B&B) algorithms are time intensive tree-based exploration me...
© 2018 This paper investigates the use of GPU (Graphics Processing Unit) in improving the bees swarm...
International audienceAssociation rules mining (ARM) is a well-known combinatorial optimization prob...
We explore in this paper the application of bioinspired approaches to the association rules mining (...
Artificial Bee Colony (ABC) optimization and k-means algorithm are popularly used in data clustering...
This paper deals with exploration and mining of association rules in big data, with the big challeng...
Inspired by the collective behavior of natural swarm, swarm intelligence algorithms (SIAs) have been...
Swarm intelligence algorithms have been widely used to solve difficult real world problems in both a...
There are many combinatorial optimization problems such as traveling salesman problem, quadratic-ass...
Graph Pattern Mining (GPM) extracts higher-order information in a large graph by searching for small...
A* search is a fundamental topic in artificial intelligence. Recently, the general purpose computat...
Reducts can be used to discern all discernible objects from the original information system. In orde...
This paper propose a parallel Apriori algorithm based on GPU (GPUApriori) for frequent itemsets mini...
This thesis deals with a population based stochastic optimization technique PSO (Particle Swarm Opti...
As of 2012, the world creates 2.5 quintillion bytes of data every day. Much of this data generated i...
International audienceBranch-and-Bound (B&B) algorithms are time intensive tree-based exploration me...