基于关联规则的二维哈希算法的改进  

Improvement of two dimension Hash algorithm based on association rules

作　　者：张江[1] 傅鹤岗[1] 

机构地区：[1]重庆大学计算机学院,重庆400044

出　　处：《计算机工程与设计》2005年第8期2178-2179,2225,共3页Computer Engineering and Design

摘　　要：对关联规则发现中应用较多的Apriori算法进行了介绍和分析。在对Apriori算法改进的二维哈希算法中引入了新的哈希函数。这种哈希函数有效地避免了哈希"冲突",有利于迅速产生二阶频繁项集,从而大幅度地提高了频繁项集产生的效率。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.

关 键 词：关联规则 频繁项集 哈希算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]