Pincer-Style Maximal Sequential Pattern Mining

淡江大學機構典藏 > 商管學院 > 資訊管理學系暨研究所 > 會議論文 > Item 987654321/101112

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/101112

题名:	Pincer-Style Maximal Sequential Pattern Mining
作者:	Jou, Chichang;Wu, Chen-Cheng
贡献者:	淡江大學資訊管理學系
关键词:	Sequential Pattern Mining
日期:	2013-07-23
上传时间:	2015-04-13 16:07:43 (UTC+8)
出版者:	IADIS
摘要:	Apriori-based sequential pattern mining algorithms use bottom-up method. They join frequent patterns with shorter length into candidate patterns with longer length, and then repeat the process until no more candidate patterns could be generated. In many applications, only frequent maximal sequential patterns (MSP), which are not a sub-sequence of any other frequent sequential pattern, are requested. In these cases, the Apriori-based algorithms will generate all sequential patterns first, and then eliminate non-maximal ones. That would perform lots of computations not directly related to the final results. For this reason, we propose the Pincer-Style Maximal Sequential Pattern Mining algorithm, PMSPM, to obtain all frequent MSPs by eliminating most of the intermediate steps in the Apriori-based algorithms. Like a pincer’s movement, PMSPM alternates bottom-up and top-down directions to find many MSPs in the early top-down stages. Thus, minings in the bottom-up direction could safely skip many repetitive procedures. PMSPM could save lots of support counting efforts to reduce computing time. We implement PMSPM and compare its performance with that of an Apriori-like algorithm. We also test effects of database parameters on its performance.
關聯:	pp.79-83
显示于类别:	[資訊管理學系暨研究所] 會議論文

文件中的档案:

没有与此文件相关的档案.

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章

数据加载中.....