| 基于FP-Tree的最大频繁项目集综合更新算法 |
| |
| 引用本文： | 赵群礼.基于FP-Tree的最大频繁项目集综合更新算法[J].安徽教育学院学报,2006,24(3):42-47. |
| |
| 作者姓名： | 赵群礼 |
| |
| 作者单位： | 安徽教育学院,计算机科学与技术系,安徽,合肥,230061 |
| |
| 摘 要： | 挖掘最大频繁项目集是多种数据挖掘应用中的关键问题,其挖掘过程的高花费要求对高效更新算法进行深入研究。为此,我们在改进频繁模式树(FP-Tree)的基础上提出了处理最小支持度和数据库都发生变化时的最大频繁项目集更新算法FUMFIA(Fast Updating Maximal Frequent Itemsets Algorithm)。通过对实验结果的分析可以看出,该算法在进行更新挖掘时具有很好的时空效率。
|
| 关 键 词： | 数据挖掘 关联规则 最大频繁项目集 频繁模式树 最小支持度 |
| 文章编号： | 1001-5116（2006）03-0042-06 |
| 收稿时间： | 2005-11-20 |
| 修稿时间： | 2005年11月20日 |
An Integrated Updating Algorithm for Mining Maximal Frequent Itemsets Based on FP-Tree |
| |
| Zhao Qun-li.An Integrated Updating Algorithm for Mining Maximal Frequent Itemsets Based on FP-Tree[J].Journal of Anhui Institute of Education,2006,24(3):42-47. |
| |
| Authors: | Zhao Qun-li |
| |
| Institution: | Department of Computer Science and Technology, Anhui Institute of Education, Hefei, 230061 |
| |
| Abstract: | Mining maximal frequent itemsets is an important problem in many applications of data mining.And the great speeding in the process requires people to studyhighly efficient updationg algorithms.So we put forward a novel algorithm FUMFIA(fast updating maximal frequent itemsets algorithm) based on an improved frequent pattern tree to dealing with the problem of updating mining maximal frequent itemsets when both minimum support and database are changed.We can see clearly from experiment results that the algorithm has excellent performance in speeding time and using memory. |
| |
| Keywords: | data mining association rules maximal frequent itemsets frequent pattern tree minimum support |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
