Optimization of Apriori Algorithm Based on Mining Association Rules

摘要：

Aimed at improving the bottlenecks of large quantity of candidate itemsets generated by multiple scanning the database in Apriori algorithm, this paper proposes an optimized algorithm of Apriori. This algorithm optimizes the joint strategy with the feature of self joint when frequent itemsets are generated. The optimized joint strategy is used in boolean matrix, which is a representation of database. The experimental results indicate that the optimized algorithm has better performance than the Apriori, especially in the case of large-scale database.

关键词： Apriori algorithm association rules frequent itemset candidate itemset boolean matrix

作者: Ying-chun Peng

作者单位: Department of Software Engineering, Shenzhen Institute of Information Technology, Shenzhen,Guangdong, China

会议类型: 国际会议

会议名称: 2010 International Conference on Bio-inspried System and Signal Processing(2010 IEEE生物系统与信号处理国际会议 ICBSSP 2010)

会议地点: 厦门

会议语种:英文

页码: 200-203

在线出版日期: 2010-10-26（万方平台首次上网日期，不代表论文的发表时间）