一种改进的Apriori挖掘关联规则算法  

An Improved Apriori Mining Association Rules Algorithm

作　　者：安颖[1,2] 

机构地区：[1]北京工业大学,北京100022 [2]北京联合大学旅游学院,北京100101

出　　处：《软件导刊》2008年第10期37-39,共3页Software Guide

摘　　要：针对数据挖掘的经典关联规则Aprior算法的效率问题提出了改进算法,即BTA算法,旨在提高算法效率。BTA算法只在产生侯选1-项集时需要遍历一次数据库,其它侯选项集的支持度计算只需统计相应TID集合的元素个数即可,而不必像Apriori算法那样反复地遍历数据库,从而提高了算法效率。This article proposed the improvement algorithm in view of the data ＂mining classics Association rules Apriori algorithm efficiency question.Namely proposed BTA （Based on Tid_set Apriori） the algorithm is for the purpose of enhancing the algorithm efficiency, efficiency. The BTA algorithm only when produces the candidate-1 sets needs only one database scan, and the count of other candidate item set members is added up only by counting the number of corresponding TID set, but does not need to look like the Apriori algorithm such repeatedly scan database, thus enhanced the algorithm efficiency.

关 键 词：数据发掘 关联规则 APFIORI算法 算法改进 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]