| 基于关联规则的二维哈希算法的改进 |
| |
| 引用本文： | 张江,傅鹤岗.基于关联规则的二维哈希算法的改进[J].计算机工程与设计,2005,26(8):2178-2179,2225. |
| |
| 作者姓名： | 张江 傅鹤岗 |
| |
| 作者单位： | 重庆大学,计算机学院,重庆,400044;重庆大学,计算机学院,重庆,400044 |
| |
| 摘 要： | 对关联规则发现中应用较多的Apriori算法进行了介绍和分析。在对Apriori算法改进的二维哈希算法中引入了新的哈希函数。这种哈希函数有效地避免了哈希“冲突”，有利于迅速产生二阶频繁项集，从而大幅度地提高了频繁项集产生的效率。
|
| 关 键 词： | 关联规则 频繁项集 哈希算法 |
| 文章编号： | 1000-7024（2005）08-2178-02 |
| 收稿时间： | 2004-09-14 |
| 修稿时间： | 2004-09-14 |
Improvement of two dimension Hash algorithm based on association rules |
| |
| ZHANG Jiang,FU He-gang.Improvement of two dimension Hash algorithm based on association rules[J].Computer Engineering and Design,2005,26(8):2178-2179,2225. |
| |
| Authors: | ZHANG Jiang FU He-gang |
| |
| Abstract: | The main idea is to induce and analyze the Apriori algorithm mainly applying in the association rules. And new Hash function was induced in two dimension Hash algorithm which improved from Apriori algorithm. This kind of Hash function avoids effectively Hash conflict and can quickly form two-order frequent itemset. Thus, it can increase, to a great extent, the efficiency resulting from frequent itemset. |
| |
| Keywords: | association rules frequent itemset Hash algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
