A fast algorithm for finding frequent episodes in event streams

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2007, Pages 410-419

  Laxman, Srivatsan ^a   Sastry, P S ^b   Unnikrishnan, K P ^c  

^a MICROSOFT RESEARCH INDIA   (India)

^b INDIAN INSTITUTE OF SCIENCE   (India)

^c GENERAL MOTORS CORPORATION   (United States)

Author keywords

Event streams; Frequent episodes; Non overlapped occurrences; Temporal data mining

Indexed keywords

EVENT STREAMS; FREQUENT EPISODES; NON-OVERLAPPED OCCURRENCES; TEMPORAL DATA MINING;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA MINING; HIDDEN MARKOV MODELS;

ALGORITHMS;

EID: 36849035828     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281192.1281238     Document Type: Conference Paper

References (10)

1. M. J. Atallah, R. Gwadera, and W. Szpankowski. Detection of significant sets of episodes in event sequences. In Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), pages 3-10, Brighton, UK, 01-04 November 2004.
2. G. Casas-Garriga. Discovering unbounded episodes in sequential data. In Proceedings of the 7th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'OS), pages 83-94, Cavtat-Dubvrovnik, Croatia, 2003.
3. R. Gwadera, M. J. Atallah, and W. Szpankowski. Reliable detection of episodes in event sequences. In Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), pages 67-74, 19-23 November 2003.
4. R. Gwadera, M. J. Atallah, and W. Szpankowski. Markov models for identification of significant episodes. In Proceedings of the 2005 SIAM International Conference on Data Mining (SDM-05), Newport Beach, California, April 2005.
5. S. Laxman. Discovering frequent episodes in event streams: Fast algorithms, connections with HMMs and generalizations. PhD thesis, Dept. of Electrical Engineering, Indian Institute of Science, Bangalore, India, Mar. 2006.
6. S. Laxman, P. S. Sastry, and K. P. Unnikrishnan. Discovering frequent episodes and learning Hidden Markov Models: A formal connection. IEEE Transactions on Knowledge and Data Engineering, 17(11):1505-1517, Nov. 2005.
7. S. Laxman, P. S. Sastry, and K. P. Unnikrishnan. Discovering frequent generalized episodes when events persist for different durations. To appear in IEEE Transactions on Knowledge and Data Engineering, 2007.
8. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1(3):259-289, 1997.
9. N. Meger and C. Rigotti. Constraint-based mining of episode rules and optimal window sizes. In Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'04), Pisa, Italy, Sept. 2004.
10. M. Regnier and W. Szpankowski. On pattern frequency occurrences in a Markovian sequence. Algorithmica, 22:631-649, 1998.