Bees Swarm Optimization for Web Association Rule Mining

This paper deals with Association Rules Mining algorithms for very large databases and especially for those existing on the web. The numerous polynomial exact algorithms already proposed in literature treated somehow in an efficient way data sets with reasonable size. However they are not capable to cope with a huge amount of data in the web context where the respond time must be very short. This paper, mainly proposes two new Association Rules Mining algorithms based on Genetic metaheuristic and Bees Swarm Optimization respectively. Experimental results show that concerning both the fitness criterion and the CPU time, IARMGA algorithm improved AGA and ARMGA two other versions based on genetic algorithm already proposed in the literature. Moreover, the same experience shows that concerning the fitness criterion, BSO-ARM achieved slightly better than all the genetic approaches. On the other hand, BSO-ARM is more time consuming. In all cases, we observed that the developed approaches yield useful association rules in a short time when comparing them with previous works.

[1]  J ZakiMohammed.  Parallel and Distributed Association Mining , 1999 .

[2]  Mohammed J. Zaki.  Parallel and distributed association mining: a survey , 1999, IEEE Concurr..

[3]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[4]  Dongsheng Liu,et al.  Improved Genetic Algorithm Based on Simulated Annealing and Quantum Computing Strategy for Mining Association Rules , 2010, J. Softw..

[5]  Ron Kohavi,et al.  Real world performance of association rule algorithms , 2001, KDD '01.

[6]  Li Sheng-yu.  An Algorithm for Mining Association Rules Based on Improved Genetic Algorithm and its Application , 2006 .

[7]  Caihui Liu,et al.  Multi-dimension association rule mining based on Adaptive Genetic Algorithm , 2011, 2011 International Conference on Uncertainty Reasoning and Knowledge Engineering.

[8]  Rakesh Agrawal,et al.  Parallel Mining of Association Rules , 1996, IEEE Trans. Knowl. Data Eng..

[9]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

[10]  Habiba Drias,et al.  Cooperative Bees Swarm for Solving the Maximum Weighted Satisfiability Problem , 2005, IWANN.

[11]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[12]  Chengqi Zhang,et al.  Genetic algorithm-based strategy for identifying association rules without specifying actual minimum support , 2009, Expert Syst. Appl..

[13]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[14]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[15]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[16]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[17]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[18]  Habiba Drias,et al.  Bees Swarm Optimization Based Approach for Web Information Retrieval , 2010, 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[19]  Mohammed J. Zaki.  Scalable Algorithms for Association Mining , 2000, IEEE Trans. Knowl. Data Eng..

[20]  Hong Guo,et al.  An Algorithm for Mining Association Rules Based on Improved Genetic Algorithm and its Application , 2009, 2009 Third International Conference on Genetic and Evolutionary Computing.