| 频繁项目集的快速增量式更新算法 |
| |
| 引用本文： | 杨明,孙志挥,宋余庆,陈耿. 频繁项目集的快速增量式更新算法[J]. 应用科学学报, 2003, 21(4): 367-372 |
| |
| 作者姓名： | 杨明 孙志挥 宋余庆 陈耿 |
| |
| 作者单位： | 东南大学计算机科学与工程系 江苏 南京 210096 |
| |
| 基金项目： | 国家自然科学基金资助项目(79970092) |
| |
| 摘 要： | 提出了频繁项目集的快速增量式更新算法(FIUA),主要考虑最小支持度发生变化时频繁项目集的更新情况.FIUA在最坏的情况下仅需扫描数据库一遍,且无需生成候选项目集,有效地节约了存储空间,提高了频繁项目集的更新效率.
|
| 关 键 词： | 数据挖掘 频繁模式树 增量式更新 频繁项目集 |
| 文章编号： | 0255-8297(2003)04-0367-06 |
| 收稿时间： | 2002-09-15 |
| 修稿时间： | 2002-12-20 |
Fast Incremental Updating of Frequent Itemsets |
| |
| YANG Ming,SUN Zhi-hui,SONG Yu-qing,CHEN Geng. Fast Incremental Updating of Frequent Itemsets[J]. Journal of Applied Sciences, 2003, 21(4): 367-372 |
| |
| Authors: | YANG Ming SUN Zhi-hui SONG Yu-qing CHEN Geng |
| |
| Affiliation: | Department of Computer Science and Engineering, Southeast University, Nanjing 210096, China |
| |
| 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. |
| |
| Keywords: | data mining frequent pattern tree frequent itemsets incremental updating |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《应用科学学报》浏览原始摘要信息 |
|
点击此处可从《应用科学学报》下载全文 |
|
