DocumentCode
2725283
Title
Mining Association Rules in Temporal Sequences
Author
Bouandas, Khellaf ; Osmani, Aomar
Author_Institution
LIPN UMR CNRS, Univ. de Paris
fYear
2007
fDate
March 1 2007-April 5 2007
Firstpage
610
Lastpage
615
Abstract
Mining association rules is an important technique for discovering meaningful patterns in datasets. Temporal association rule mining can be decomposed into two phases: finding temporal frequent patterns and finding temporal rules construction. Till date, a large number of algorithms have been proposed in the area of mining association rules. However, most of these algorithms consider patterns as a collection of point primitives and their three basic relations (<, =, >). Several applications consider patterns with duration and need to reason about intervals and their thirteen possible relationships. In this paper we investigate properties of temporal sequences represented as a collection of intervals. We present a simple framework for temporal sequence and describe DATTES (Discovering pATterns in TEmporal Sequences), an innovative algorithm using interval properties to mine temporal patterns. The framework can be used to mine temporal association rules. According to some interval algebra properties, this paper introduces a new confidence evaluation function for mining temporal rules. Experiments on real dataset (human face identification problem) show the effectiveness and the performances of this approach.
Keywords
data mining; dataset patterns; human face identification problem; temporal association rule mining; temporal sequences; Algebra; Association rules; Computational intelligence; Data mining; Face; Humans; Itemsets; Terminology;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Data Mining, 2007. CIDM 2007. IEEE Symposium on
Conference_Location
Honolulu, HI
Print_ISBN
1-4244-0705-2
Type
conf
DOI
10.1109/CIDM.2007.368932
Filename
4221356
Link To Document