摘要
对挖掘关联规则中FUP算法的关键思想以及性能进行了研究,提出了改进的FUP算法 SFUP。该算法充分利用原有挖掘结果中候选频繁项集的支持数,能有效减少对数据库的重复扫描次 数,并通过实验对这两种算法进行比较,结果充分说明了SFUP算法的效率要明显优于FUP算法。
An improved incremental updating algorithm SFUP was proposed based on study of the principle and efficiency of FUP algorithm. The algorithm made full use of the old data mining results and reduces the times of scanning the database greatly, thus the data mining efficiency increases. Some experiments show that SFUP is better than FUP at many aspects.
出处
《计算机应用》
CSCD
北大核心
2005年第4期830-832,共3页
journal of Computer Applications
关键词
数据挖掘
关联规则
增量更新
FUP算法
data mining
association rules
incremental updating
FUP algorithm
