Fast Mining of Closed Sequential Patterns

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Journal Article > Item 987654321/17390

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/17390

Title:	Fast Mining of Closed Sequential Patterns
Authors:	Lin, Nancy P.;Hao, Wei-hua;Chen, Hung-jen;Chueh, Hao-en;Chang, Chung-i
Contributors:	淡江大學軍訓室
Keywords:	data mining;sequential patterns mining;closed sequential patterns
Date:	2008-04
Issue Date:	2013-06-07 10:46:07 (UTC+8)
Publisher:	Athens: World Scientific and Engineering Academy and Society
Abstract:	This paper propose a novel algorithm for mining closed frequent sequences, a scalable, condensed and lossless structure of complete frequent sequences that can be mined from a sequence database. This algorithm, FMCSP, has applied several optimization methods, such as equivalence class, to alleviate the needs of searching space and run time. In particular, since one of the main issues in this type of algorithms is the redundant generation of the closed sequences, hence, we propose an effective and memory saving methods, different from previous works, does not require the complete set of closed sequences to be residing in the memory.
Relation:	WSEAS Transactions on Computers 7(4), pp.133-139
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	370	View/Open