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 s1 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.
J. Balcázar, A. Bifet, and A. Lozano. Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007), volume 4604 of Lecture Notes in Artificial Intelligence, page 347-359. Berlin, Heidelberg, Springer-Verlag, (July 2007)
E. Cem, and O. Ozkasap. Proceedings of the 25th International Symposium on Computer and Information Sciences, page 199-202. Springer Netherlands, (2011)