Authors:
A. Ben Zakour
1
;
M. Sistiaga
1
;
S. Maabout
2
and
M. Mosbah
2
Affiliations:
1
2MoRO, France
;
2
Université de Bordeaux, France
Keyword(s):
Frequent pattern, Time constraint, Relax constraint, Sequential pattern mining.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Information Extraction
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Symbolic Systems
Abstract:
Unlike frequent sets extraction for which only minimum support condition must be met, sequential patterns satisfy time constraints. Commonly, to consider two events as successive, these constraints are either to respect minimum and maximum time gap or to be included into a window size. In this paper, we introduce a new definition of “interesting sequences”. This property suggests that temporal patterns, introducing concepts of sliding window, can be customized by the user so that the events chronology in the extracted sequences has not to strictly obey to the original event sequence.This definition is incorporated in the process of a conventional algorithm (Fournier-Viger et al., 2008). The extracted patterns have an interval time stamp form and represent an interesting palette of the original data.