| 一种优化的关联规则增量更新算法 |
| |
| 引用本文： | 董卫萍,郑厚天.一种优化的关联规则增量更新算法[J].计算机应用与软件,2009,26(9):137-138,145. |
| |
| 作者姓名： | 董卫萍 郑厚天 |
| |
| 作者单位： | 绍兴文理学院计算机系,浙江,绍兴,312000 |
| |
| 摘 要： | 针对PFUP算法存在扫描多次数据库这个瓶颈问题,提出一种优化的关联规则增量更新算法MIFUP(Mixed Improve Fast Updating).该算法提出了两种优化策略:借鉴事务压缩原理和用数组存放一阶非频繁项集个数.实验仿真说明,MIFUP算法效率明显优于PFUP算法.
|
| 关 键 词： | FUP算法 UWEP算法 PFUP算法 MIFUP算法 |
AN OPTIMIZED INCREMENTAL UPDATING ALGORITHM FOR ASSOCIATION RULES |
| |
| Dong Weiping,Zheng Houtian.AN OPTIMIZED INCREMENTAL UPDATING ALGORITHM FOR ASSOCIATION RULES[J].Computer Applications and Software,2009,26(9):137-138,145. |
| |
| Authors: | Dong Weiping Zheng Houtian |
| |
| Affiliation: | Department of Computer Science;Shaoxing University;Shaoxing 312000;Zhejiang;China |
| |
| Abstract: | To solve the bottleneck problem of PFUP algorithm which scans database many times,a new improved optimized incremental updating 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. |
| |
| Keywords: | FUP algorithm UWEP algorithm PFUP algorithm MIFUP algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
