This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Discovering Frequent Generalized Episodes When Events Persist for Different Durations
September 2007 (vol. 19 no. 9)
pp. 1188-1201
This paper is concerned with the framework of frequent episode discovery in event sequences. A new temporal pattern, called the generalized episode, is defined which extends this framework by incorporating event duration constraints explicitly into the pattern?s definition. This new formalism facilitates extension of the technique of episodes discovery to applications where data appears as a sequence of events that persist for different durations (rather than being instantaneous). We present efficient algorithms for episode discovery in this new framework. Through extensive simulations we show the expressive power of the new formalism. We also show how the duration constraint possibilities can be used as a design choice to properly focus the episode discovery process. Finally, we briefly discuss some interesting results obtained on data from manufacturing plants of General Motors .

[1] R. Srikanth and R. Agrawal, “Mining Sequential Patterns: Generalizations and Performance Improvements,” Proc. Fifth Int'l Conf. Extending Database Technology (EDBT '96), Mar. 1996.
[2] H. Mannila, H. Toivonen, and A.I. Verkamo, “Discovery of Frequent Episodes in Event Sequences,” Data Mining and Knowledge Discovery, vol. 1, no. 3, pp. 259-289, 1997.
[3] J. Han, G. Dong, and Y. Yin, “Efficient Mining of Partial Periodic Patterns in Time Series Database,” Proc. 15th Int'l Conf. Data Eng., (ICDE '99), pp. 106-115, 1999.
[4] S. Laxman, P.S. Sastry, and K.P. Unnikrishnan, “Discovering Frequent Episodes and Learning Hidden Markov Models: A Formal Connection,” IEEE Trans. Knowledge and Data Eng., vol. 17, no. 11, pp. 1505-1517, Nov. 2005.
[5] G. Casas-Garriga, “Discovering Unbounded Episodes in Sequential Data,” Proc. Seventh European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD '03), pp. 83-94, 2003.
[6] M.J. Atallah, R. Gwadera, and W. Szpankowski, “Detection of Significant Sets of Episodes in Event Sequences,” Proc. Fourth IEEE Int'l Conf. Data Mining (ICDM '04), pp. 3-10, Nov. 2004.
[7] M. Hirao, S. Inenaga, A. Shinohara, M. Takeda, and S. Arikawa, “A Practical Algorithm to Find the Best Episode Patterns,” Proc. Fourth Int'l Conf. Discovery Science (DS '01), pp. 435-441, Nov. 2001.
[8] Z. Tronicek, “Episode Matching,” Proc. 12th Ann. Symp. Combinatorial Pattern Matching (CPM '01), vol. 2089, pp. 143-146, July 2001.
[9] S. Laxman, P.S. Sastry, and K.P. Unnikrishnan, “Fast Algorithms for Frequent Episode Discovery in Event Sequences,” Proc. Third Workshop Mining Temporal and Sequential Data, Aug. 2004.
[10] H. Mannila and H. Toivonen, “Discovering Generalized Episodes Using Minimal Occurrences,” Proc. Second Int'l Conf. Knowledge Discovery and Data Mining (KDD '96), pp. 146-151, Aug. 1996.
[11] N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, “Discovering Frequent Closed Itemsets for Association Rules,” Proc. Seventh Int'l Conf. Database Theory (ICDT '99), pp. 398-416, Jan. 1999.
[12] S. Laxman, “Discovering Frequent Episodes: Fast Algorithms, Connections with HMMs and Generalizations,” PhD dissertation, Dept. of Electrical Eng., Indian Inst. of Science, Mar. 2006.

Index Terms:
Data mining, sequential data, frequent episodes, efficient algorithms, event durations
Citation:
Srivatsan Laxman, P. Sastry, K. Unnikrishnan, "Discovering Frequent Generalized Episodes When Events Persist for Different Durations," IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 9, pp. 1188-1201, Sept. 2007, doi:10.1109/TKDE.2007.1055
Usage of this product signifies your acceptance of the Terms of Use.