摘要： 首先提出了一个新的概念—后备频繁项目集,其次给出了一种新的增量式更新算法NEWFUP,最后介绍了在某中小型商业企业的事务数据库中该算法的实现。
关键词:
关联规则,
事务数据库,
频繁项目集,
增量式更新,
后备频繁项目集
Abstract: In this paper, we propose the concept of mothball frequent item sets and design a novel efficient incremental mining algorithm that doesnt need to rescan the original databases until a number of transactions have come. The experiments show that NEWFUP is efficient.
中图分类号:
朱玉全,汪晓刚. 一种新的关联规则增量式更新算法[J]. , 2002, 28(04): 35-37.
ZHU Yuquan, WANG Xiaogang. A Novel Incremental Updating Algorithm for Mining Association Rules[J]. , 2002, 28(04): 35-37.