摘要
考虑事务数据库D长度不变、项目集I发生变化并且带有权重时的关联规则挖掘问题,提出了一种针对项目集增加的加权关联规则更新算法,解决了增加项目集的加权关联规则更新问题,与对新数据库重新运行算法相比,其运行效率有显著提高.
In this paper, we consider the mining of weighted association rules on condition that the length of transaction database D is unchanged and the set of items I is changed; propose a new incremental updating algorithm of weighted association rules. The algorithm can resolve the problem of the mining of weighted association rules when the set of items has been updated. Compared to the algorithm, the efficiency of the algorithm has been greatly improved.
出处
《福州大学学报（自然科学版）》
CAS
CSCD
北大核心
2008年第4期501-505,共5页
Journal of Fuzhou University(Natural Science Edition)
基金
福州大学科技发展基金资助项目(2008-XY-15)
关键词
数据挖掘
加权关联规则
增量更新算法
data mining
weighted association rules
incremental updating algorithm
