|
|||||
|
|
| 利用Hash树生成频繁项目集的新方法 | |
| 引用本文： | 吉根林,赵斌,孙志挥.利用Hash树生成频繁项目集的新方法[J].小型微型计算机系统,2004,25(10):1841-1843. |
| 作者姓名： | 吉根林 赵斌 孙志挥 |
| 作者单位： | 1. 东南大学,计算机系,江苏,南京,210096;南京师范大学,计算机系,江苏,南京,210097 2. 南京师范大学,计算机系,江苏,南京,210097 3. 东南大学,计算机系,江苏,南京,210096 |
| 基金项目： | 国家自然科学基金(79970092)资助; 江苏省教育厅自然科学基金(2001SXXTSJB112)的资助. |
| 摘 要： | 频繁项目集的生成是关联规则挖掘中的关键问题 .提出基于 Hash树的频繁项目集生成新方法 ,探讨了 Hash树中候选项目集的数据组织与建立算法 ,提出了利用 Hash树计算候选项目集支持数的算法 ,并用 Java语言实现了该算法 ,最后通过实验验证了利用 Hash树生成频繁项目集的有效性 |
| 关 键 词： | Hash树 频繁项目集 关联规则 |
| 文章编号： | 1000-1220(2004)10-1841-03 |
Generating Frequent Itemsets Using Hash Tree |
|
| JI Gen lin ,ZHAO Bin ,SUN Zhi hui.Generating Frequent Itemsets Using Hash Tree[J].Mini-micro Systems,2004,25(10):1841-1843. | |
| Authors: | JI Gen lin ZHAO Bin SUN Zhi hui |
| Affiliation: | JI Gen lin 1,2,ZHAO Bin 2,SUN Zhi hui 1 1 |
| Abstract: | The generation of frequent itemsets is a key problem of mining association rules. Develop ed hash tree based algorithm for generation of frequent k itemsets. The definition and the creation algorithm of hash tree were introduced. The problem of discovering frequent k itemsets can be solved by constructing a hash tree that contains a candidate set of frequent k itemsets first and then, counting support number of candidate frequent k itemsets by traveling the hash tree. The performance of hash tree based algorithm is studied andcompared with Apriori algorithm. The experiment shows that the hash tree based algorithm is valid and efficient. |
| Keywords: | hash tree frequent itemsets association rules |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |