Perfect Hashing Schemes for Mining Traversal Patterns

ASIAIR > College of Computer Science > Department of Computer Science and Information Engineering > Journal Artical > Item 310904400/6522

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/6522

Title:	Perfect Hashing Schemes for Mining Traversal Patterns
Authors:	Chang, C. C.;Lin, C. Y.;Chou, H. C.
Keywords:	data mining;traversal patterns;perfect hashing;performance analysis
Date:	2006-02
Issue Date:	2009-12-17 06:58:26 (UTC+0)
Publisher:	Asia University
Abstract:	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.
Relation:	Fundamenta Informaticae 70(3):185-202
Appears in Collections:	[Department of Computer Science and Information Engineering] Journal Artical

Files in This Item:

File	Description	Size	Format
		0Kb	Unknown	474	View/Open
310904400-6522.doc		90Kb	Microsoft Word	279	View/Open