An efficient tree-based algorithm for mining sequential patterns with multiple minimum supports

NCU Institutional Repository > 管理學院 > 資訊管理學系 > 期刊論文 > Item 987654321/106390

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

题名:	An efficient tree-based algorithm for mining sequential patterns with multiple minimum supports
作者:	胡雅涵;Hu, Ya-Han;Wu, Fan;Liao, Yi-Jiun
贡献者:	管理學院資訊管理學系
关键词:	Algorithms;Computer programs;Data mining;Management information systems;Multiple minimum supports;Pattern recognition;PLWAP-tree;Resonant frequency;Sequential patterns;Software engineering;Stores;Studies
日期:	2013-05-01
上传时间:	2026-04-23 13:19:56 (UTC+8)
出版者:	Elsevier Inc.;New York: Elsevier Inc
摘要:	摘要： ► Multiple minimum supports can prune the search space in sequential pattern mining (SPM). ► An efficient tree-based method is proposed for SPM with multiple minimum supports. ► The algorithm is evaluated by both synthetic and real-life datasets. ► Experimental results show our method is more efficient than traditional methods. Sequential pattern mining (SPM) is an important technique for determining time-related behavior in sequence databases. In real-life applications, the frequencies for various items in a sequence database are not exactly equal. If all items are set with the same minimum support, the rare item problem may result, meaning that we are unable to effectively retrieve interesting patterns regardless of whether minsup is set too high or too low. Liu (2006) first included the concept of multiple minimum supports (MMSs) to SPM. It allows users to specify the minimum item support (MIS) for each item according to its natural frequency. A generalized sequential pattern-based algorithm, named Multiple Supports – Generalized Sequential Pattern (MS-GSP), was also developed to mine complete set of sequential patterns. However, the MS-GSP adopts candidate generate-and-test approach, which has been recognized as a costly and time-consuming method in pattern discovery. For the efficient mining of sequential patterns with MMSs, this study first proposes a compact data structure, called a Preorder Linked Multiple Supports tree (PLMS-tree), to store and compress the entire sequence database. Based on a PLMS-tree, we develop an efficient algorithm, Multiple Supports – Conditional Pattern growth (MSCP-growth), to discover the complete set of patterns. The experimental result shows that the proposed approach achieves more preferable findings than the MS-GSP and the conventional SPM. 出版者： New York: Elsevier Inc 出版日期： 2013-05 出處： The Journal of systems and software, 2013-05, Vol.86 (5), p.1224-1238 資源來源： Elsevier ScienceDirect Journals Complete 版權： 2012 Elsevier Inc. 版權： Copyright Elsevier Sequoia S.A. May 2013 識別號： ISSN: 0164-1212 識別號： EISSN: 1873-1228 識別號： DOI: 10.1016/j.jss.2012.12.020 識別號： CODEN: JSSODM
显示于类别:	[資訊管理學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	27	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing

数据加载中.....