基于逆向搜索的关联规则更新算法  

Association Rules Updating Algorithm Based on Reverse Search

作　　者：陈煜[1] 徐维祥[1] 

机构地区：[1]北京交通大学交通运输学院,北京100044

出　　处：《计算机工程》2011年第8期25-27,共3页Computer Engineering

基　　金：国家科技支撑计划基金资助项目(2009BAG12A10);北京市科委基金资助项目(Z090506006309011)

摘　　要：对现有关联规则更新算法中的增量式更新算法进行分析,发现在决策者优先关注最大频繁项目集的情况下,该算法不能以较少的数据库遍历次数快速获取最大频繁项集。针对该算法的不足,提出一种基于逆向搜索的方式进行关联规则更新的算法。该算法生成新增项集的所有频繁项集,通过将其中最大频繁项集跟原项集中最大频繁项集进行拼接、修剪,从中获得更新后的最大频繁项集。实例结果表明,该算法既降低了关联规则更新过程中对数据库的遍历次数,又实现了优先获取最大频繁项目集。This paper analyzes the existing association rules updating algorithm Incremental Updating Algorithm（IUA）, finds out that when the decision makers give priority attention to the situation of maximum frequent iterasets, this algorithm can not lower the cost of the database traversal to quickly access to the largest number of frequent itemsets. For the lack of the algorithm, an algorithm which is based on reverse search approach to update association rules is presented. The updating algorithm based on reverse search generates all frequent itemsets of new itemsets. It splices the new largest frequent itemsets and original largest frequent itemsets for trimming, gets the updating maximal frequent itemsets. The algorithm not only reduces the traversal times in the process of association rules updating, but also realizes the priority access to the largest operation of frequent itemsets.

关 键 词：逆向搜索 关联规则 更新算法 增量式更新算法 最大频繁项目集 

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