Mining frequent diamond episodes from event sequences

Abstract

In this paper, we introduce a diamond episode of the form s1 → E → s2, where s1 and s2 are events and E is a set of events. The diamond episode s1 → E → s2 means that every event of E follows an event s2 and is followed by an event s2. Then, by formulating the support of diamond episodes, in this paper, we design the algorithm FREQDMD to extract all of the frequent diamond episodes from a given event sequence. Finally, by applying the algorithm FREQDMD to bacterial culture data, we extract diamond episodes representing replacement of bacteria. © Springer-Verlag Berlin Heidelberg 2007.