# HUSP-SP: Faster Utility Mining on Sequence Data

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

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 11 of its 54 references that are in the map.
- First posted on arXiv 29 Dec 2022.

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

- [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)
- [ProUM: Projection-based Utility Mining on Sequence Data](https://mlsanity.com/paper/1904.07764/) (2019)
- [TUSQ: Targeted High-Utility Sequence Querying](https://mlsanity.com/paper/2103.16615/) (2021)
- [TKUS: Mining Top-K High-Utility Sequential Patterns](https://mlsanity.com/paper/2011.13454/) (2020)
- [Privacy Preserving Utility Mining: A Survey](https://mlsanity.com/paper/1811.07389/) (2018)
- [On-shelf Utility Mining of Sequence Data](https://mlsanity.com/paper/2011.13455/) (2020)
- [Explainable Fuzzy Utility Mining on Sequences](https://mlsanity.com/paper/2103.16519/) (2021)
- [Utility Mining Across Multi-Dimensional Sequences](https://mlsanity.com/paper/1902.09582/) (2019)
- [Correlated Utility-based Pattern Mining](https://mlsanity.com/paper/1904.03336/) (2019)
- [Utility Mining Across Multi-Sequences with Individualized Thresholds](https://mlsanity.com/paper/1912.11673/) (2019)

## Abstract (arXiv)

High-utility sequential pattern mining (HUSPM) has emerged as an important topic due to its wide application and considerable popularity. However, due to the combinatorial explosion of the search space when the HUSPM problem encounters a low utility threshold or large-scale data, it may be time-consuming and memory-costly to address the HUSPM problem. Several algorithms have been proposed for addressing this problem, but they still cost a lot in terms of running time and memory usage. In this paper, to further solve this problem efficiently, we design a compact structure called sequence projection (seqPro) and propose an efficient algorithm, namely discovering high-utility sequential patterns with the seqPro structure (HUSP-SP). HUSP-SP utilizes the compact seq-array to store the necessary information in a sequence database. The seqPro structure is designed to efficiently calculate candidate patterns' utilities and upper bound values. Furthermore, a new upper bound on utility, namely tighter reduced sequence utility (TRSU) and two pruning strategies in search space, are utilized to improve the mining performance of HUSP-SP. Experimental results on both synthetic and real-life datasets show that HUSP-SP can significantly outperform the state-of-the-art algorithms in terms of running time, memory usage, search space pruning efficiency, and scalability.