Sciweavers

Share
ICDM
2005
IEEE

Discovering Frequent Arrangements of Temporal Intervals

9 years 5 months ago
Discovering Frequent Arrangements of Temporal Intervals
In this paper we study a new problem in temporal pattern mining: discovering frequent arrangements of temporal intervals. We assume that the database consists of sequences of events, where an event occurs during a time-interval. The goal is to mine arrangements of event intervals that appear frequently in the database. There are many applications where these type of patterns can be useful, including data network, scientific, and financial applications. Efficient methods to find frequent arrangements of temporal intervals using both breadth first and depth first search techniques are described. The performance of the proposed algorithms is evaluated and compared with other approaches on real datasets (American Sign Language streams and network data) and large synthetic datasets.
Panagiotis Papapetrou, George Kollios, Stan Sclaro
Added 24 Jun 2010
Updated 24 Jun 2010
Type Conference
Year 2005
Where ICDM
Authors Panagiotis Papapetrou, George Kollios, Stan Sclaroff, Dimitrios Gunopulos
Comments (0)
books