%0 Journal Article
%T Two Methods of Building Hash-tree for Mining Frequent Itemsets<br>频繁项集挖掘中的两种哈希树构建方法
%A 杜孝平
%A 罗宪
%A 唐世渭
%J 计算机科学
%D 2002
%I 
%X 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.
%K Hash-tree
%K Frequent itemset
%K Data mining
%K Database
%K Knowledge discovery<br>数据库
%K 数据挖掘
%K 频繁项集挖掘
%K 哈希树构建方法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=9761813617129B8B&yid=C3ACC247184A22C1&vid=771469D9D58C34FF&iid=59906B3B2830C2C5&sid=09E495F616948E78&eid=B0EBA60720995721&journal_id=1002-137X&journal_name=计算机科学&referenced_num=1&reference_num=9