| 基于FC-tree的频繁闭项目集挖掘算法 |
| |
| 引用本文： | 任永功,张亮,付玉,吕君义. 基于FC-tree的频繁闭项目集挖掘算法[J]. 计算机科学, 2008, 35(9): 149-152 |
| |
| 作者姓名： | 任永功 张亮 付玉 吕君义 |
| |
| 作者单位： | 辽宁师范大学计算机与信息技术学院,大连,116029;辽河油田锦州工程技术处,凌海,121209 |
| |
| 基金项目： | 国家自然科学基金，辽宁省自然科学基金，辽宁省教育厅资助项目，辽宁省大连市青年科技基金 |
| |
| 摘 要： | 目前提出的频繁项目集挖掘算法大多基于Apriori算法思想,但这类算法会产生巨大的候选集并且重复扫描数据库.本文针对这一问题,给出了一种基于FC-tree的频繁闭项目集挖掘算法Max-FCIA,该算法将频繁项目集存储在哈希表中,节省了程序的搜索时间.此外,利用广度优先搜索和有效的剪枝策略,大大限制了候选项目集的生成,缩小了搜索空间从而提高了程序的性能.实验结果表明该算法是快速有效的.
|
| 关 键 词： | 频繁项目集 频繁闭项目集 最小频繁闭项目集 最大频繁闭项目集 FC-tree (频繁闭模式树) |
Algorithm Based on FC-tree for Mining Frequent Closed Itemsets |
| |
| REN Yong-gong,ZHANG Liang,FU Yu,LU Jun-yi. Algorithm Based on FC-tree for Mining Frequent Closed Itemsets[J]. Computer Science, 2008, 35(9): 149-152 |
| |
| Authors: | REN Yong-gong ZHANG Liang FU Yu LU Jun-yi |
| |
| Affiliation: | REN Yong-gong1 ZHANG Liang1 FU Yu1 LU Jun-yi2(School of Computer , Information Technology,Liaohe Normal University,Dalian 116029,China)1(Jinzhou Engineering & Technology Department of Liaoning Oilfield,Linhai 121209,China)2 |
| |
| Abstract: | Most mining algorithms of frequent Itemsets are based on Apriori.However,these algorithms make huge candidate itemsets and scan large database again and again.In order to solve this problem, an efficient algorithm called Max-FCIA based on FC-tree for mining frequent closed itemsets is proposed.The algorithm stores frequent Itemsets in hash table,which reduce the searching time.By breadth first search strategy and efficient pruning methods,making the frequent closed itemsets restrains the number of candidate... |
| |
| Keywords: | Frequent itemsets Frequent closed itemsets Minimum frequent closed itemsets Maximal frequent closed itemsets FC-tree (Frequent Pattern Tree) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机科学》浏览原始摘要信息 |
|
点击此处可从《计算机科学》下载全文 |
|
