An important usage of time sequences is to discover temporal patterns. The discovery process usually starts with a user-specified skeleton, called an event structure, which consists of a number of variables representing events and temporal constraints among these variables; the goal of the discovery is to find temporal patterns, i.e., instantiations of the variables in the structure that appear frequently in the time sequence. This paper introduces event structures that have temporal constraints with multiple granularities, defines the pattern-discovery problem with these structures, and studies effective algorithms to solve it. The basic components of the algorithms include timed automata with granularities (TAGs) and a number of heuristics. The TAGs are for testing whether a specific temporal pattern, called a candidate complex event type, appears frequently in a time sequence. Since there are often a huge number of candidate event types for a usual event structure, heuristics are presented aiming at reducing the number of candidate event types and reducing the time spent by the TAGs testing whether a candidate type does appear frequently in the sequence. These heuristics exploit the information provided by explicit and implicit temporal constraints with granularity in the given event structure. The paper also gives the results of an experiment to show the effectiveness of the heuristics on a real data set. © 1998 IEEE.
|Titolo:||Discovering frequent event patterns with multiple granularities in time sequences|
BETTINI, CLAUDIO (Primo)
|Parole Chiave:||Data mining ; Knowledge discovery ; Temporal constraints ; Temporal databases ; Temporal patterns ; Time granularity ; Time sequences ; Control and Systems Engineering ; Electrical and Electronic Engineering ; Artificial Intelligence ; Information Systems|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Data di pubblicazione:||1998|
|Digital Object Identifier (DOI):||10.1109/69.683754|
|Appare nelle tipologie:||01 - Articolo su periodico|