Fast algorithms for frequent episode discovery in event sequences

Srivatsan Laxman, P. S. Sastry, and K. P. Unnikrishnan

Abstract

In this paper we consider the process of discovering frequent episodes in event sequences. The most computationally intensive part of this process is that of counting the frequencies of a set of candidate episodes. We present two new frequency counting algorithms for speeding up this part. These, referred to as non-overlapping and non-inteleaved frequency counts, are based on directly counting suitable subsets of the occurrences of an episode. Hence they are different from the frequency counts of Mannila et al [1], where they count the number of windows in which the episode occurs. Our new frequency counts offer a speed-up factor of 7 or more on real and synthetic datasets. We also show how the new frequency counts can be used when the events in episodes have time-durations as well.

Details

Publication typeInproceedings
Published inProceedings of the 3rd Workshop on Mining Temporal and Sequential Data, SIGKDD, Seattle, WA
PublisherAssociation for Computing Machinery, Inc.
> Publications > Fast algorithms for frequent episode discovery in event sequences