# MDL-based Compressing Sequential Rules

arXiv: https://arxiv.org/abs/2212.10252 · HTML: https://mlsanity.com/paper/2212.10252/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 9 of its 46 references that are in the map.
- First posted on arXiv 20 Dec 2022.

## Builds on (most cited first, 9 of 9)

- [A Survey of Utility-Oriented Pattern Mining](https://mlsanity.com/paper/1805.10511/) (2018)
- [A Survey of Parallel Sequential Pattern Mining](https://mlsanity.com/paper/1805.10515/) (2018)
- [The Minimum Description Length Principle for Pattern Mining: A Survey](https://mlsanity.com/paper/2007.14009/) (2020)
- [HUOPM: High Utility Occupancy Pattern Mining](https://mlsanity.com/paper/1812.10926/) (2018)
- [US-Rule: Discovering Utility-driven Sequential Rules](https://mlsanity.com/paper/2111.15020/) (2021)
- [cgSpan: Closed Graph-Based Substructure Pattern Mining](https://mlsanity.com/paper/2112.09573/) (2021)
- [Mining Periodic Patterns with a MDL Criterion](https://mlsanity.com/paper/1807.01706/) (2018)
- [Discovering Useful Compact Sets of Sequential Rules in a Long Sequence](https://mlsanity.com/paper/2109.07519/) (2021)
- [Towards Target Sequential Rules](https://mlsanity.com/paper/2206.04728/) (2022)

## Built on by (most cited first, 1 of 1)

- [Seqret: Mining Rule Sets from Event Sequences](https://mlsanity.com/paper/2505.06049/) (2025)

## Abstract (arXiv)

Nowadays, with the rapid development of the Internet, the era of big data has come. The Internet generates huge amounts of data every day. However, extracting meaningful information from massive data is like looking for a needle in a haystack. Data mining techniques can provide various feasible methods to solve this problem. At present, many sequential rule mining (SRM) algorithms are presented to find sequential rules in databases with sequential characteristics. These rules help people extract a lot of meaningful information from massive amounts of data. How can we achieve compression of mined results and reduce data size to save storage space and transmission time? Until now, there has been little research on the compression of SRM. In this paper, combined with the Minimum Description Length (MDL) principle and under the two metrics (support and confidence), we introduce the problem of compression of SRM and also propose a solution named ComSR for MDL-based compressing of sequential rules based on the designed sequential rule coding scheme. To our knowledge, we are the first to use sequential rules to encode an entire database. A heuristic method is proposed to find a set of compact and meaningful sequential rules as much as possible. ComSR has two trade-off algorithms, ComSR_non and ComSR_ful, based on whether the database can be completely compressed. Experiments done on a real dataset with different thresholds show that a set of compact and meaningful sequential rules can be found. This shows that the proposed method works.