An Incremental Mining Algorithm for Association Rules based on Minimal Perfect Hashing and Pruning

CHUR > College Computer Science and Informatics > Department of Computer Science and Information Engineering > Seminar Papers > Item 987654321/31305

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/31305

Title:	An Incremental Mining Algorithm for Association Rules based on Minimal Perfect Hashing and Pruning
Authors:	曾秋蓉 Tseng, Judy C.R.
Contributors:	資訊工程學系 Computer Science & Information Engineering
Keywords:	data mining;association rule;incremental mining
Date:	2012
Issue Date:	2014-06-27 01:25:29 (UTC+8)
Abstract:	In the literatures, hash-based association rule mining algorithms are more efficient than Apriori-based algorithms, since they employ hash functions to generate candidate itemsets efficiently. However, when the dataset is updated, the whole hash table nee
Appears in Collections:	[Department of Computer Science and Information Engineering] Seminar Papers

Files in This Item:

File	Description	Size	Format
s_e331_0177.pdf		27Kb	Adobe PDF	136	View/Open