频繁项集挖掘中的两种哈希树构建方法

doi:10.3969/j.issn.1002-137X.2002.12.039

CORC > 北京大学 > 信息科学技术学院

	频繁项集挖掘中的两种哈希树构建方法; Two Methods of Building Hash-tree for Mining Frequent Itemsets
	杜孝平 ; 罗宪 ; 唐世渭
刊名	计算机科学
	2002
关键词	Hash-tree Frequent itemset Data mining Database Knowledge discovery Hash-tree Frequent itemset Data mining Database Knowledge discovery
DOI	10.3969/j.issn.1002-137X.2002.12.039
英文摘要	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.; 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.; 国家重点基础研究发展计划(973计划); 教育部留学回国人员科研启动基金; 中文核心期刊要目总览(PKU); 中国科学引文数据库(CSCD); 0; 12; 138-140; 29
语种	中文
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/22890]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	杜孝平,罗宪,唐世渭. 频繁项集挖掘中的两种哈希树构建方法, Two Methods of Building Hash-tree for Mining Frequent Itemsets[J]. 计算机科学,2002.
APA	杜孝平,罗宪,&唐世渭.(2002).频繁项集挖掘中的两种哈希树构建方法.计算机科学.
MLA	杜孝平,et al."频繁项集挖掘中的两种哈希树构建方法".计算机科学 (2002).