An algorithmic approach to event summarization

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 183-194

  Wang, Peng ^a,b   Wang, Haixun ^b   Liu, Majin ^a   Wang, Wei ^a  

^a FUDAN UNIVERSITY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

event summarization; hidden markov model; minimal description length

Indexed keywords

ALGORITHMIC APPROACH; DATA SUMMARIZATIONS; GENERATION PROCESS; INTERNAL DYNAMICS; INTERNAL STATE; INTERPRETABILITY; MINIMAL DESCRIPTION LENGTH; PIECE-WISE;

HIDDEN MARKOV MODELS;

EID: 77954736323     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807189     Document Type: Conference Paper

References (21)

1. Rakesh Agrawal and Ramajrishnan Srikant. Mining sequential patterns. In ICDE, 1995.
2. Gemma Casas-Garriga. Discovering unbounded episodes in sequential data. In PKDD, 2003.
3. Shixi Chen, Haixun Wang, and Shuigeng Zhou. Concept clustering of evolving data. In ICDE, 2009.
4. Shixi Chen, Haixun Wang, Shuigeng Zhou, and Philip S. Yu. Stop chasing trends: Discovering high order models in evolving data. In ICDE, 2008.
5. Yannis Manolopoulos Christos Faloutsos, M. Ranganathan. Fast subsequence matching in time-series databases. In SIGMOD, 1994.
6. Sudipto Guha, Nick Koudas, and Kyuseok Shim. Data-streams and histograms. In STOC, 2001.
7. Panagiotis Karras, Dimitris Sacharidis, and Nikos Mamoulis. Exploiting duality in summarization with deterministic guarantees. In SIGKDD, 2007.
8. Eamonn Keogh, Kaushik Chakrabarti, Sharad Mehrotra, and Michael Pazzani. Locally adaptive dimensionality reduction for indexing large time series databases. In SIGMOD, 2001.
9. Eamonn Keogh, Selina Chu, David Hart, and Michael Pazzani. An online algorithm for segmenting time series. In ICDM, 2001.
10. Jerry Kiernan and Evimaria Terzi. Constructing comprehensive summaries of large event sequences. In SIGKDD, 2008.
11. Mikko Koivisto, Markus Perola, T. Varilo, W. Hennah, J. Ekelund, Margus Lukk L. Peltonen, Esko Ukkonen, and Heikki Mannila. An mdl method for finding haplotype blocks and for estimating the strength of haplotype block boundaries. In Pacific Symposium on Biocomputing, 2003.
12. Srivatsan Laxman, Vikram Tankasali, and Ryen White. Stream prediction using a generative model based on frequent episodes in event sequences. In SIGKDD, 2008.
13. Srivatsan Laxman and P. S. Sastryand 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, 2005.
14. Heikki Mannila and Marko Salmenkivi. Finding simple intensity descriptions from event sequence data. In SIGKDD, 2001.
15. Heikki Mannila, Hannu Toivonen, and Inkeri Verkamo. Discovery of frequent episodes in event sequences. In DMKD, 1997.
16. Nicolas Meger and Christophe Rigotti. Constraint-based mining of episode rules and optimal window sizes. In PKDD, 2004.
17. Kin pong Chan and Ada Wai chee Fu. Efficient time series matching by wavelets. In ICDE, 1999.
18. J. Rissanen. Modeling by shortest data description. Automatica, 14:465-471, 1978.
19. H. Wang, W. Fan, P. S. Yu, and J. Han. Mining concept-drifting data streams using ensemble classifiers. In KDD, 2003.
20. H.Wang, J. Yin, J. Pei, P.S. Yu and J. X. Yu. Suppressing model overfitting in mining concept-drifting data streams. In KDD, 2006.
21. Ying Yang, Xindong Wu, and Xingquan Zhu. Combining proactive and reactive predictions for data streams. In SIGKDD, 2005.