Name
Abstract | ||
|---|---|---|
Most of the sequential patterns extraction methods proposed so far deal with patterns composed of events linked by temporal relationships based on simple precedence between instants. In many real situations, some quantitative information about event duration or inter-event delay is necessary to discriminate phenomena. We propose the algorithm QTIPrefixSpan for extracting temporal patterns composed of events to which temporal intervals describing their position in time and their duration are associated. It extends algorithm PrefixSpan with a multi-dimensional interval clustering step for extracting the representative temporal intervals associated to events in patterns. Experiments on simulated data show that our algorithm is efficient for extracting precise patterns even in noisy contexts and that it improves the performance of a former algorithm which used a clustering method based on the EM algorithm. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.5591/978-1-57735-516-8/IJCAI11-221 | IJCAI |
Keywords | Field | DocType |
algorithm qtiprefixspan,temporal interval,representative temporal interval,temporal relationship,former algorithm,clustering method,sequential patterns extraction method,algorithm prefixspan,em algorithm,interval-based sequence,temporal pattern | PrefixSpan,Data mining,Pattern recognition,Computer science,Expectation–maximization algorithm,Artificial intelligence,Cluster analysis,Machine learning | Conference |
Citations | PageRank | References |
5 | 0.47 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Guyet | 1 | 100 | 15.98 |
| René Quiniou | 2 | 100 | 14.23 |