论文信息 - Association Rule Mining Based on Bat Algorithm

Association Rule Mining Based on Bat Algorithm

In this paper, we propose a bat-based algorithm (BA) for association rule mining (ARM Bat). Our algorithm aims to maximize the fitness function to generate the best rules in the defined dataset starting from a specific minimum support and minimum confidence. The efficiency of our proposed algorithm is tested on several generic datasets with different number of transactions and items. The results are compared to FPgrowth algorithm results on the same datasets. ARM bat algorithm perform better than the FPgrowth algorithm in term of computation speed and memory usage,

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

[2] Sharma Sanjeev,et al. A Review on Application of Particle Swarm Optimization in Association Rule Mining , 2013 .

[3] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.

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

[5] R. J. Kuo,et al. Application of particle swarm optimization to association rule mining , 2011, Appl. Soft Comput..

[6] Xin-She Yang,et al. A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.

[7] Habiba Drias,et al. Bees Swarm Optimization for Web Association Rule Mining , 2012, 2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology.

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

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