Two Methods of Building Hash-tree for Mining Frequent Itemsets
频繁项集挖掘中的两种哈希树构建方法

Hash-tree is an important data structure used in Apriori-like algorithms for mining frequent itemsets.However, there is no study so far to guarantee the hash-tree could be built successfully every time. In this paper, wepropose a static method and a dynamic one to build the hash-tree. In the two methods, it is easy to decide the size ofhash-table, hash function and the number of itemsets stored in each leaf-node of hash-tree, and the methods ensurethat the hash-tree is built successfully in any cases.