计算机应用 ›› 2005, Vol. 25 ›› Issue (04): 830-832.DOI: 10.3724/SP.J.1087.2005.0830

• 软件与数据库 • 上一篇    下一篇

一种高效的关联规则增量更新算法

商志会,陶树平   

  1. 同济大学电子与信息工程学院
  • 发布日期:2005-04-01 出版日期:2005-04-01

High efficient incremental updating algorithm for mining association rules

SHANG Zhi-hui,TAO Shu-ping   

  1. College of Electronics and Information Engineering,Tongji University
  • Online:2005-04-01 Published:2005-04-01

摘要:

对挖掘关联规则中FUP算法的关键思想以及性能进行了研究,提出了改进的FUP算法 SFUP。该算法充分利用原有挖掘结果中候选频繁项集的支持数,能有效减少对数据库的重复扫描次 数,并通过实验对这两种算法进行比较,结果充分说明了SFUP算法的效率要明显优于FUP算法。

关键词: 数据挖掘, 关联规则, 增量更新, FUP算法

Abstract:

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.

Key words: data mining, association rules, incremental updating, FUP algorithm

中图分类号: