Perfect Hashing Schemes for Mining Traversal Patterns

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/6522

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6522

题名:	Perfect Hashing Schemes for Mining Traversal Patterns
作者:	Chang, C. C.;Lin, C. Y.;Chou, H. C.
关键词:	data mining;traversal patterns;perfect hashing;performance analysis
日期:	2006-02
上传时间:	2009-12-17 06:58:26 (UTC+0)
出版者:	Asia University
摘要:	Hashing schemes are a common technique to improve the performance in mining not only association rules but also sequential patterns or traversal patters. However, the collision problem in hash schemes may result in severe performance degradation. In this paper, we propose perfect hashing schemes for mining traversal patterns to avoid collisions in the hash table. The main idea is to transform each large itemsets into one large 2-itemset by employing a delicate encoding scheme. Then perfect hash schemes designed only for itemsets of length two, rather than varied lengths, are applied. The experimental results show that our method is more than twice as faster than FS algorithm. The results also show our method is scalable to database sizes. One variant of our perfect hash scheme, called partial hash, is proposed to cope with the enormous memory space required by typical perfect hash functions. We also give a comparison of the performances of different perfect hash variants and investigate their properties.
關聯:	Fundamenta Informaticae 70(3):185-202
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
		0Kb	Unknown	474	检视/开启
310904400-6522.doc		90Kb	Microsoft Word	279	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.