Sorted Compressed Tree: An Improve Method of Frequent Patterns Mining without Support Constraint

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

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

Title:	Sorted Compressed Tree: An Improve Method of Frequent Patterns Mining without Support Constraint
Authors:	曾秋蓉 Tseng, Judy C.R.
Contributors:	資訊工程學系 Computer Science & Information Engineering
Keywords:	association rule mining;without suppoort constrain;CSTS tree;SC Tree
Date:	2010
Issue Date:	2014-06-27 01:24:44 (UTC+8)
Abstract:	Several algorithms have been proposed for association rule mining, such as Apriori and FP Growth. In these algorithms, a minimum support should be decided for mining large itemsets. However, it is usually the case that several minimum supports should be u
Appears in Collections:	[Department of Computer Science and Information Engineering] Seminar Papers

Files in This Item:

File	Description	Size	Format
s_e331_0170.pdf		27Kb	Adobe PDF	93	View/Open