Utility-driven mining of contiguous sequences

doi:10.1007/s13042-026-03207-0

Utility-driven mining of contiguous sequences

2026-07-09

0

PRE

AI

DOI：10.1007/s13042-026-03207-0

Original

Original request for help

Save

Abstract

En 中文

Recently, contiguous sequential pattern mining (CSPM) gained interest as a research topic, due to its varied potential real-world applications, such as web log and biological sequence analysis. To date, studies on the CSPM problem remain in preliminary stages. The existing CSPM algorithms lack the efficiency to satisfy users’ needs and can still be improved in terms of runtime and memory consumption. In addition, existing algorithms were developed to deal with simple sequence data, working with only one event at a time. Complex sequence data, which represent multiple events occurring simultaneously, are also commonly observed in real life. In this paper, we propose a novel algorithm, fast utility-driven contiguous sequential pattern mining (FUCPM), to address the CSPM problem. FUCPM adopts a compact sequence information list and instance chain structures to store the necessary information of the database and candidate patterns. For further efficiency, we develop the global unpromising items pruning and local unpromising items pruning strategies, based on sequence-weighted utilization and item-extension utilization, to reduce the search space. Extensive experiments on real-world and synthetic datasets demonstrate that FUCPM outperforms the state-of-the-art algorithms and is scalable enough to handle complex sequence data.

Keywords:

Sequence data

Utility mining

Sequential pattern

Contiguous

Utility-driven mining of contiguous sequences

Abstract

Journal

Organization