Mining Frequent Bipartite Episode from Event Sequences
In this paper, first we introduce a bipartite episode of the form A ↦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 \(\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.
Unable to display preview. Download preview PDF.
- 1.Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. 20th VLDB, pp. 487–499 (1994)Google Scholar
- 5.Katoh, T., Hirata, K.: Mining frequent elliptic episodes from event sequences. In: Proc. 5th LLLL, pp. 46–52 (2007)Google Scholar
- 7.Katoh, T., Arimura, H., Hirata, K.: A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences. In: Theeramunkong, T., et al. (eds.) PAKDD 2009. LNCS (LNAI), vol. 5476, pp. 172–183. Springer, Heidelberg (2009)Google Scholar
- 11.Pei, J., Wang, H., Liu, J., Wang, K., Wang, J., Yu, P.S.: Discovering frequent closed partial orders from strings. IEEE TKDE 18, 1467–1481 (2006)Google Scholar
- 13.Uno, T.: Two general methods to reduce delay and change of enumeration algorithms, NII Technical Report, NII-2003-004E (April 2003)Google Scholar
- 14.Zaki, M.J.: Scalable Algorithms for Association Mining. IEEE TKDE 12, 372–390 (2000)Google Scholar
- 15.Zaki, M.J., Hsiao, C.-J.: CHARM: An efficient algorithm for closed itemset mining. In: Proc. 2nd SDM, pp. 457–478. SIAM, Philadelphia (2002)Google Scholar