.png){kind=icon}
Return
Discovering time-interval sequential patterns in sequence databases
.png){kind=icon}
PRE
AI
DOI：10.1016/S0957-4174(03)00075-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sequential pattern mining, which discovers frequent subsequences as patterns in a sequence database, in an important data-mining problem with broad applications. Although conventional sequential patterns can reveal the order of items, the time between items is not determined; that is, a sequential pattern does not include time intervals between successive items. Accordingly, this work addresses sequential patterns that include time intervals, called time-interval sequential patterns. This work develops two efficient algorithms for mining time-interval sequential patterns. The first algorithm is based on the conventional Apriori algorithm, while the second one is based on the PrefixSpan algorithm. The latter algorithm outperforms the former, not only in computing time but also in scalability with respect to various parameters. (C) 2003 Elsevier Ltd. All rights reserved.
Keywords:
sequential patterns
sequence data
data mining
time interval
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W
Organization
No organization information available
Cited Papers
No cited papers available