Fifth IEEE International Conference on Data Mining (ICDM'05) (2005)
Nov. 27, 2005 to Nov. 30, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2005.50
Panagiotis Papapetrou , Boston University
George Kollios , Boston University
Stan Sclaroff , Boston University
Dimitrios Gunopulos , University of California at Riverside
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.
S. Sclaroff, G. Kollios, P. Papapetrou and D. Gunopulos, "Discovering Frequent Arrangements of Temporal Intervals," Fifth IEEE International Conference on Data Mining (ICDM'05)(ICDM), Houston, Texas, 2005, pp. 354-361.