<?xml version="1.0" encoding="ISO-8859-1" ?>
<report no="C-1997-15"
  title="Discovery of frequent episodes in event sequences"
  date="February 1997"
  pages="45"
  genterms="Algorithms, Experimentation"
  keywords="Knowledge Discovery, Data Mining, Event Sequences, Frequent Episodes, Sequence Analysis"
  issn=""
  isbn="">
<author name="Heikki Mannila"/>
<author name="Hannu Toivonen"/>
<author name="A. Inkeri Verkamo"/>
<class name="H.3.1 Content Analysis and Indexing"/>
<class name="F.2.2 Nonnumerical Algorithms and Problems"/>
<class name="I.2.6 Learning"/>
<class name="C.2.3 Network Operations"/>
<file url="C-1997-15.ps.gz"/>
<abstract>
<p>
Sequences of events describing the behavior and actions of users or systems
can be collected in several domains. We consider the problem of discovering
frequently occurring episodes in such sequences. An episode is defined to
be a collection of events that occur relatively close to each other in a given
partial order. Once such episodes are known, one can produce rules for
describing or predicting the behavior of the sequence. We give efficient
algorithms for the discovery of all frequent episodes from a given class of
episodes, and present extensive experimental results. The methods are in
use in telecommunication alarm management.
</p>
</abstract>
</report>

