English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Paper

Efficiently Summarising Event Sequences with Rich Interleaving Patterns

MPS-Authors
/persons/resource/persons197297

Bhattacharyya,  Apratim
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons79525

Vreeken,  Jilles
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:1701.08096.pdf
(Preprint), 448KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Bhattacharyya, A., & Vreeken, J. (2017). Efficiently Summarising Event Sequences with Rich Interleaving Patterns. Retrieved from http://arxiv.org/abs/1701.08096.


Cite as: https://hdl.handle.net/11858/00-001M-0000-002D-90E4-A
Abstract
Discovering the key structure of a database is one of the main goals of data mining. In pattern set mining we do so by discovering a small set of patterns that together describe the data well. The richer the class of patterns we consider, and the more powerful our description language, the better we will be able to summarise the data. In this paper we propose \ourmethod, a novel greedy MDL-based method for summarising sequential data using rich patterns that are allowed to interleave. Experiments show \ourmethod is orders of magnitude faster than the state of the art, results in better models, as well as discovers meaningful semantics in the form patterns that identify multiple choices of values.