Mining Compressing Sequential Patterns

DOI10.1002/sam.11192OpenAlexW2096126105MaRDI QIDQ4969924

Toon Calders, Fabian Mörchen, Dmitriy Fradkin, Hoang Thanh Lam

Publication date: 14 October 2020

Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sam.11192

zbMATH Keywords

complexityminimum description lengthsequence datacompressing patterns miningcompression-based pattern mining

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Related Items (11)

Targeted and contextual redescription set exploration ⋮ Sequential pattern mining for ICT risk assessment and management ⋮ SPEck: mining statistically-significant sequential patterns efficiently with exact sampling ⋮ CSPM: discovering compressing stars in attributed graphs ⋮ NWP-miner: nonoverlapping weak-gap sequential pattern mining ⋮ Finding the longest common sub-pattern in sequences of temporal intervals ⋮ Ranking episodes using a partition model ⋮ Efficiently mining cohesion-based patterns and rules in event sequences ⋮ Skopus: mining top-\(k\) sequential patterns under leverage ⋮ The minimum description length principle for pattern mining: a survey ⋮ Top-k sequence pattern mining with non-overlapping condition

Uses Software

• PrefixSpan
• StreamKrimp
• Krimp

Cites Work

• Unnamed Item
• Krimp: mining itemsets that compress
• Maximum entropy models and subjective interestingness: an application to tiles in binary databases
• Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
• Clustering by Compression
• Data compression via textual substitution
• Discovery Science
• A Method for the Construction of Minimum-Redundancy Codes

This page was built for publication: Mining Compressing Sequential Patterns