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 frequen...

Full description

Saved in:
Bibliographic Details
Published inFifth IEEE International Conference on Data Mining (ICDM'05) p. 8 pp.
Main Authors Papapetrou, P., Kollios, G., Sclaroff, S., Gunopulos, D.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2005
Subjects
Computer science
Data mining
Event detection
Handicapped aids
Intrusion detection
Monitoring
Transaction databases
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9780769522784
0769522785
ISSN:1550-4786
2374-8486
DOI:10.1109/ICDM.2005.50