| 一种改进的关联规则维护算法 |
| |
| 引用本文： | 徐文拴,辛运帏.一种改进的关联规则维护算法[J].计算机工程与应用,2006,42(18):178-180. |
| |
| 作者姓名： | 徐文拴 辛运帏 |
| |
| 作者单位： | 南开大学计算机科学与技术系,天津,300071 |
| |
| 摘 要： | 提出了关联规则维护更新问题的背景,分析了经典的关联规则维护算法FUP2算法的局限性,针对在数据库数据集增加和删除时最小支持度同时变化的情况,提出了一种改进的关联规则维护算法EFUP,并与经典的Apriori算法进行了分析比较,表明了该算法充分利用了原有的信息,提高了算法的效率。
|
| 关 键 词： | 数据挖掘 关联规则 维护 增量更新 频繁项集 |
| 文章编号： | 1002-8331-（2006）18-0178-03 |
| 收稿时间： | 2005-09 |
| 修稿时间： | 2005-09 |
An Improved Algorithm for Maintaining Discovered Association Rules |
| |
| Xu Wenshuan,Xin Yunwei.An Improved Algorithm for Maintaining Discovered Association Rules[J].Computer Engineering and Applications,2006,42(18):178-180. |
| |
| Authors: | Xu Wenshuan Xin Yunwei |
| |
| Affiliation: | Department of Computer Science and Technology, Nankai University,Tianjin 300071 |
| |
| Abstract: | The issue of maintaining discovered association rules is an important research topic among the various association rules mining problems.The paper explains the limitation of the classical FUP2 algorithm,proposes an improved algorithm EFUP for maintaining association rules provided that the transactions in a database is added,deleted and also the minimum support is changed,and further,compares the algorithm with the Apriori algorithm.The research result shows that the EFUP algorithm takes full advantage of former information and the rate of the algorithm is increased. |
| |
| Keywords: | data mining association rules maintenance incremental updating frequent itemset |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
