On mining multi-time-interval sequential patterns

NCU Institutional Repository > 管理學院 > 資訊管理研究所 > 期刊論文 > Item 987654321/29668

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

题名:	On mining multi-time-interval sequential patterns
作者:	Hu,YH;Huang,TCK;Yang,HR;Chen,YL
贡献者:	資訊管理研究所
关键词:	TRAVERSAL PATTERNS;LARGE DATABASES;SEQUENCES;ALGORITHM
日期:	2009
上传时间:	2010-06-29 20:37:47 (UTC+8)
出版者:	中央大學
摘要:	Sequential pattern mining is essential in many applications, including computational biology, consumer behavior analysis, web log analysis, etc. Although sequential patterns can tell us what items are frequently to be purchased together and in what order, they cannot provide information about the time span between items for decision support. Previous studies dealing with this problem either set time constraints to restrict the patterns discovered or define time-intervals between two successive items to provide time information. Accordingly, the first approach falls short in providing clear time-interval information while the second cannot discover time-interval information between two non-successive items in a sequential pattern. To provide more time-related knowledge, we define a new variant of time-interval sequential patterns, called multi-time-interval sequential patterns, which can reveal the time-intervals between all pairs of items in a pattern. Accordingly, we develop two efficient algorithms, called the MI-Apriori and MI-PrefixSpan algorithms, to solve this problem. The experimental results show that the MI-PrefixSpan algorithm is faster than the MI-Apriori algorithm. but the MI-Apriori algorithm has better scalability in long sequence data. (C) 2009 Elsevier B.V. All rights reserved.
關聯:	DATA & KNOWLEDGE ENGINEERING
显示于类别:	[資訊管理研究所] 期刊論文

文件中的档案:

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

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

社群 sharing

数据加载中.....