Constructing comprehensive summaries of large event sequences

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

Volumn , Issue , 2008, Pages 417-425

  Kiernan, Jerry ^a   Terzi, Evimaria ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Event sequences; Log mining; Summarization

Indexed keywords

ALTERNATIVE APPROACHES; CAPTURE SYSTEMS; EVENT SEQUENCES; HIGH QUALITIES; LARGE DATA SETS; LOCAL PATTERNS; LOCAL STRUCTURES; LOG MINING; OPTIMIZATION PROBLEMS; POLYNOMIAL-TIME; PROGRAMMING ALGORITHMS; REAL DATA SETS; SEQUENCE MININGS; SUMMARIZATION; USER ACTIVITIES;

INFORMATION MANAGEMENT; MINING; POLYNOMIAL APPROXIMATION;

GRAPHICAL USER INTERFACES;

EID: 65449159832     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401943     Document Type: Conference Paper

References (20)

1. R. Agrawal and R. Srikant. Mining Sequential Patterns. In ICDE, 1995.
2. R. Bellman. On the approximation of curves by line segments using dynamic programming. Communications of the ACM, 4(6), 1961.
3. D. Chudova and P. Smyth. Pattern discovery in sequences under a markov assumption. In KDD, pages 153-162, 2002.
4. S. Guha, N. Koudas, and K. Shim. Data-streams and histograms. In STOC, pages 471-475, 2001.
5. P. Karras, D. Sacharidis, and N. Mamoulis. Exploiting duality in summarization with deterministic guarantees. In KDD, pages 380-389, 2007.
6. E. J. Keogh, S. Chu, D. Hart, and M. J. Pazzani. An online algorithm for segmenting time series. In ICDM, pages 289-296, 2001.
7. P. Kilpeläinen, H. Mannila, and E. Ukkonen. Mdl learning of unions of simple pattern languages from positive examples. In EuroCOLT, pages 252-260, 1995.
8. M. Koivisto, M. Perola, T. Varilo, et al. An MDL method for finding haplotype blocks and for estimating the strength of haplotype block boundaries. In Pacific Symposium on Biocomputing, pages 502-513, 2003.
9. H. Mannila and M. Salmenkivi. Finding simple intensity descriptions from event sequence data. In KDD, pages 341-346, 2001.
10. H. Mannila and H. Toivonen. Discovering generalized episodes using minimal occurrences. In KDD , pages 146-151, 1996.
11. M. Mehta, J. Rissanen, and R. Agrawal. Mdl-based decision tree pruning. In KDD, pages 216-221, 1995.
12. S. Papadimitriou and P. Yu. Optimal multi-scale patterns in time series streams. In SIGMOD , pages 647-658, 2006.
13. J. Pei, J. Han, and W. Wang. Constraint-based sequential pattern mining: the pattern-growth methods. J. Intell. Inf. Syst., 28(2): 133-160, 2007.
14. L. R. Rabiner and B. H. Juang. An introduction to Hidden Markov Models. IEEE ASSP Magazine, pages 4-15, January 1986.
15. J. Rissanen. Modeling by shortest data description. Automatica, 14:465-471, 1978.
16. J. Rissanen. Stochastic Complexity in Statistical Inquiry Theory. World Scientific Publishing Co., Inc., River Edge, NJ, USA, 1989.
17. Y. Sakurai, S. Papadimitriou, and C. Faloutsos. Braid: Stream mining through group lag correlations. In SIGMOD, pages 599-610, 2005.
18. E. Terzi and P. Tsaparas. Efficient algorithms for sequence segmentation. In SDM, 2006.
19. J. Yang, W. Wang, P. S. Yu, and J. Han. Mining long sequential patterns in a noisy environment. In SIGMOD, pages 406-417, 2002.
20. Y. Zhu and D. Shasha. Statstream: Statistical monitoring of thousands of data streams in real time. In VLDB, pages 358-369, 2002.