Mining Frequent Bipartite Episode from Event Sequences

Abstract. In this paper, first we introduce a bipartite episode of the form A 7 → B for two sets A and B of events, which means that every event of A is followed by every event of B. Then, we present an algorithm that finds all frequent bipartite episodes from an input sequence without duplication in O(| | · N) time per an episode and in O(||2n) space, where is an alphabet, N is total input size of S, and n is the length of S. Finally, we give experimental results on artificial and real sequences to evaluate the efficiency of the algorithm.