Constructing comprehensive summaries of large event sequences

ACM Transactions on Knowledge Discovery from Data

Volumn 3, Issue 4, 2009, Pages

  Kiernan, Jerry ^a   Terzi, Evimaria ^b  

^a IBM   (United States)

^b BOSTON UNIVERSITY   (United States)

Author keywords

Event sequences; Log mining; Summarization

Indexed keywords

ALTERNATIVE APPROACH; CAPTURE SYSTEM; EVENT SEQUENCE; HIGH QUALITY; LARGE DATASETS; LOCAL PATTERNS; LOCAL STRUCTURE; LOG MINING; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; PROGRAMMING ALGORITHMS; REAL DATA SETS; SEQUENCE MINING; USER ACTIVITY;

POLYNOMIAL APPROXIMATION;

GRAPHICAL USER INTERFACES;

EID: 72449201090     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1631162.1631169     Document Type: Article

References (37)

1. AGRAWAL, R. AND SRIKANT, R. 1995. Mining Sequential Patterns. In Proceedings of the 11th International Conference on Data Engineering.
2. ALLAN, J., GUPTA, R., AND KHANDELWAL, V. 2001. Temporal summaries of news topics. In SIGIR. ACM, New York, 10-18.
3. BELLMAN,R. 1961. On the approximation of curves by line segments using dynamic programming. Commun. ACM 4, 6.
4. BETTINI, C.,WANG, X. S., AND JAJODIA, S. 1998. Mining temporal relationships with multiple granularities in time sequences. Data Eng. Bull. 21, 1, 32-38.
5. BRANTS, T. ANDCHEN, F. 2003. Asystem for new event detection. In Proceedings of the International Conference on Research and Development in Information Retrieval (SIGIR). ACM, New York, 330-337.
6. CHUDOVA, D. AND SMYTH, P. 2002. Pattern discovery in sequences under a markov assumption. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD). ACM, New York, 153-162.
7. ELFEKY, M., AREF, W., AND ELMAGARMID, A. 2004. Using convolution to mine obscure periodic patterns in one pass. In Proceedings of the 9th International Conference on Extending Database Technology (EDBT).
8. GIONIS, A. AND MANNILA, H. 2003. Finding recurrent sources in sequences. In Proceedings of the International Conference on Research in Computational Molecular Biology (RECOMB). 123-130.
9. GUHA, S., KOUDAS, N., AND SHIM, K. 2001. Data-streams and histograms. In Proceedings of the Symposium on the Theory of Computing (STOC). IEEE Computer Society Press, Los Alamitos, CA, 471-475.
10. HAN, J., DONG, G., AND YIN, Y. 1999. Efficient mining of partial periodic patterns in time series database. In Proceedings of the 15th International Conference on Data Engineering.
11. HAN, J., GONG, W., AND YIN, Y. 1998. Mining segment-wise periodic patterns in time-related databases. In Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD). ACM, New York, 214-218.
12. KARRAS, P., SACHARIDIS, D., AND MAMOULIS, N. 2007. Exploiting duality in summarization with deterministic guarantees. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). ACM, New York, 380-389.
13. KEOGH, E. J., CHU, S., HART, D., AND PAZZANI, M. J. 2001. An online algorithm for segmenting time series. In Proceedings of the IEEE International Conference on Data Mining (ICDM). IEEE Computer Society Press, Los Alamitos, CA, 289-296.
14. KIERNAN, J. AND TERZI, E. 2009. Eventsummarizer: A tool for summarizing large event sequences. In Proceedings of the International Conference on Extending Database Technology (EDBT). To appear.
15. KILPEL̈AINEN, P., MANNILA, H., AND UKKONEN, E. 1995. MDL learning of unions of simple pattern languages from positive examples. In Proceedings of the EuroCOLT. 252-260.
16. KLEINBERG, J. 2003. Bursty and hierarchical structure in streams. Data Min. Knowl. Disc. 7, 373-397.
17. KOIVISTO, M., PEROLA, M.,VARILO, T.,HENNAH,W.,EKELUND, J., LUKK, M., PALTONEN, L.,UKKONEN, E., AND MANNILA, J. 2003. AnMDLmethod for finding haplotype blocks and for estimating the strength of haplotype block boundaries. In Proceedings of the Pacific Symposium on Biocomputing. 502-513.
18. LI,W. 2001a. DNAsegmentation as a model selection process. In Proceedings of the International Conference on Research in Computational Molecular Biology (RECOMB). 204-210.
19. LI, W. 2001b. New stopping criteria for segmenting DNA sequences. Phys. Rev. Lett. 86, 5815-5818.
20. MA, S. AND HELLERSTEIN, J. L. 2001. Mining partially periodic event patterns with unknown periods. In Proceedings of the 17th International Conference on Data Engineering.
21. MANNILA, H. AND SALMENKIVI,M. 2001. Finding simple intensity descriptions from event sequence data. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). ACM, New York, 341-346.
22. MANNILA,H. AND TOIVONEN,H. 1996. Discovering generalized episodes using minimal occurrences. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD). ACM, New York, 146-151.
23. MANNILA, H., TOIVONEN, H., AND VERKAMO, A. I. 1997. Discovery of frequent episodes in event sequences. Data Min. Knowl. Disc. 1, 3, 259-289. (Pubitemid 127721244)
24. MEHTA, M., RISSANEN, J., AND AGRAWAL, R. 1995. MDL-based decision tree pruning. In Proceedings of the ACM SIGKDD International Conference of Knowledge Discovery and Data Mining (KDD). ACM, New York, 216-221.
25. PAPADIMITRIOU, S. AND YU, P. 2006. Optimal multi-scale patterns in time series streams. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, New York, 647-658.
26. PEI, J., HAN, J., AND WANG, W. 2007. Constraint-based sequential pattern mining: The patterngrowth methods. J. Intell. Inf. Syst. 28, 2, 133-160. (Pubitemid 46479918)
27. RABINER, L. R. AND JUANG, B. H. 1986. An introduction to Hidden Markov Models. IEEE ASSP Magazine, 4-15.
28. RISSANEN, J. 1978. Modeling by shortest data description. Automatica 14, 465-471.
29. RISSANEN, J. 1989. Stochastic Complexity in Statistical Inquiry Theory. World Scientific Publishing Co., Inc., River Edge, NJ.
30. RUZZO, W. L. AND TOMPA, M. 1999. A linear time algorithm for finding all maximal scoring subsequences. In Proceedings of the 7th International Conference on Intelligent Systems for Molecular Biology. AAAI Press, Menlo Park, CA, 234-241.
31. SAKURAI, Y., PAPADIMITRIOU, S., AND FALOUTSOS, C. 2005. Braid: Stream mining through group lag correlations. In Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, New York, 599-610.
32. SRIKANT, R. AND AGRAWAL, R. 1996. Mining sequential patterns: Generalizations and performance improvements. In Proceedings of the International Conference on Extending Database Technology (EDBT). 3-17.
33. SWAN, R. C. AND ALLAN, J. 2000. Automatic generation of overview timelines. In Proceedings of the International Conference on Research and Development in Information Retrieval (SIGIR). ACM, New York, 49-56.
34. TERZI, E. AND TSAPARAS, P. 2006. Efficient algorithms for sequence segmentation. In Proceedings of the SIAM International Conference on Data Mining (SDM).
35. YANG, J., WANG, W., YU, P. S., AND HAN, J. 2002. Mining long sequential patterns in a noisy environment. In Proceedings of the ACMSIGMOD International Conference on Management of Data. ACM, New York, 406-417.
36. YANG, Y., AULT, T., PIERCE, T., AND LATTIMER, C. W. 2000. Improving text categorization methods for event tracking. In Proceedings of the International Conference on Research and Development in Information Retrieval (SIGIR). ACM, New York, 65-72.
37. ZHU, Y. AND SHASHA, D. 2002. Statstream: Statistical monitoring of thousands of data streams in real time. In Proceedings of the Very Large Data Bases (VLDB) Conference. ACM, New York, 358-369.