Efficiently Summarising Event Sequences with Rich Interleaving Patterns

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.

References in corpus (1)

• Ranking Episodes using a Partition Model

Cited by in corpus (16)

• AEGCN: An Autoencoder-Constrained Graph Convolutional Network
• UniG-Encoder: A Universal Feature Encoder for Graph and Hypergraph Node Classification
• Tight lower bounds for Dynamic Time Warping
• SDCOR: Scalable Density-based Clustering for Local Outlier Detection in Massive-Scale Datasets
• Network representation learning systematic review: ancestors and current development state
• A Team-Formation Algorithm for Faultline Minimization
• Localization of multilayer networks by the optimized single-layer rewiring
• The climatic interdependence of extreme-rainfall events around the globe
• Hyperbolic Node Embedding for Signed Networks
• EvoPath: Evolutionary Meta-path Discovery with Large Language Models for Complex Heterogeneous Information Networks
• A Survey of Latent Factor Models in Recommender Systems
• SLIDE: a surrogate fairness constraint to ensure fairness consistency
• Scalable Kernel Logistic Regression with Nyström Approximation: Theoretical Analysis and Application to Discrete Choice Modelling
• TANGNN: a Concise, Scalable and Effective Graph Neural Networks with Top-m Attention Mechanism for Graph Representation Learning
• Manifold regularization based on Nystr{ö}m type subsampling
• Efficient Top-k s-Biplexes Search over Large Bipartite Graphs