Extracting Trees of Quantitative Serial Episodes - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2007

Extracting Trees of Quantitative Serial Episodes

Résumé

Among the family of the local patterns, episodes are commonly used when mining a single or multiple sequences of discrete events. An episode reflects a qualitative relation is-followed-by over event types, and the refinement of episodes to incorporate quantitative temporal information is still an on going research, with many application opportunities. In this paper, focusing on serial episodes, we design such a refinement called quantitative episodes and give a corresponding extraction algorithm. The three most salient features of these quantitative episodes are: (1) their ability to characterize main groups of homogeneous behaviors among the occurrences, according to the duration of the is-followed-by steps, and providing quantitative bounds of these durations organized in a tree structure; (2) the possibility to extract them in a complete way; and (3) to perform such extractions at the cost of a limited overhead with respect to the extraction of standard episodes.

Dates et versions

hal-01613806 , version 1 (10-10-2017)

Identifiants

Citer

Mirco Nanni, Christophe Rigotti. Extracting Trees of Quantitative Serial Episodes. S. Dzeroski, J. Struyf. Knowledge Discovery in Inductive Databases : 5th International Workshop, KDID 2006 Berlin, Germany, September 18, 2006 Revised Selected and Invited Papers, 4747, Springer, pp.170-188, 2007, Lecture Notes in Computer Science, LNCS, 978-3-540-75548-7. ⟨10.1007/978-3-540-75549-4_11⟩. ⟨hal-01613806⟩
82 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More