Mining Frequent Bipartite Episode from Event Sequences

* Final gross prices may vary according to local VAT.

Get Access


In this paper, first we introduce a bipartite episode of the form AB 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(|Σ|2 n) space, where Σ is an alphabet, N is total input size of \(\mathcal 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.

This work is partially supported by Grand-in-Aid for JSPS Fellows (20·3406).