一种优化的关联规则增量更新算法  

AN OPTIMIZED INCREMENTAL UPDATING ALGORITHM FOR ASSOCIATION RULES

作　　者：董卫萍[1] 郑厚天[1] 

机构地区：[1]绍兴文理学院计算机系,浙江绍兴312000

出　　处：《计算机应用与软件》2009年第9期137-138,145,共3页Computer Applications and Software

摘　　要：针对PFUP算法存在扫描多次数据库这个瓶颈问题,提出一种优化的关联规则增量更新算法MIFUP(Mixed Improve Fast Updating)。该算法提出了两种优化策略:借鉴事务压缩原理和用数组存放一阶非频繁项集个数。实验仿真说明,MIFUP算法效率明显优于PFUP算法。To solve the bottleneck problem of PFUP algorithm which scans database many times, a new improved optimized incremental up- dating algorithm for association rules, MIFUP, is presented. In the executing process of MIFUP algorithm, it adopts two optimized strategies. One is the transaction compress theory, and the other is the array for storing the number of first-order non-frequent item sets. Finally, the simulation experiment shows that MIFUP algorithm is more efficient than PFUP algorithm.

关 键 词：FUP算法 UWEP算法 PFUP算法 MIFUP算法 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论] TS103.63[自动化与计算机技术—计算机科学与技术]