English

应用科学学报 ›› 2003, Vol. 21 ›› Issue (4): 367-372.

• 论文 • 上一篇    下一篇

频繁项目集的快速增量式更新算法

杨明, 孙志挥, 宋余庆, 陈耿   

  1. 东南大学计算机科学与工程系 江苏 南京 210096
  • 收稿日期:2002-09-15 修回日期:2002-12-20 出版日期:2003-12-10 发布日期:2003-12-10
  • 作者简介:杨明(1964-),男,安徽宁国人,副教授,博士生;孙志挥(1941-),男,江苏南通人,教授,博导.
  • 基金资助:
    国家自然科学基金资助项目(79970092)

Fast Incremental Updating of Frequent Itemsets

YANG Ming, SUN Zhi-hui, SONG Yu-qing, CHEN Geng   

  1. Department of Computer Science and Engineering, Southeast University, Nanjing 210096, China
  • Received:2002-09-15 Revised:2002-12-20 Online:2003-12-10 Published:2003-12-10

PDF

79

被引次数

11

摘要： 提出了频繁项目集的快速增量式更新算法(FIUA),主要考虑最小支持度发生变化时频繁项目集的更新情况.FIUA在最坏的情况下仅需扫描数据库一遍,且无需生成候选项目集,有效地节约了存储空间,提高了频繁项目集的更新效率.

关键词: 数据挖掘, 频繁模式树, 增量式更新, 频繁项目集

Abstract: Mining frequent itemsets is a major problem in the data mining field with numerous practical appilcations. Efficient incremental updating of discovered frequent itemsets is the key problem. The existing incremental updating algorithms employ the same framework as Apriori, which need to generate a lots of candidate sets and repeatedly scan the database, especially when there exist many patterns and/or long patterns. In this paper, we propose an incremental updating algorithm of frequent itemsets (FIUA) mainly for the updating of frequent itemsets as a time when the minimum support threshold adjusts dynamically. In worst case, FIUA only scans transaction database once and need not generate candidate sets, which saves effectively storage space. Therefore, FIUA is efficient and effective.

Key words: frequent pattern tree, data mining, frequent itemsets, incremental updating

中图分类号: