The paper formalizes low-utility sequential pattern mining and proposes three algorithms (LUSPM_b baseline, LUSPM_s with shrinkage, LUSPM_e with extension) that use a sequence-utility chain and pruning to efficiently find all such patterns.
Fast utility mining on sequence data,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Mining of Low-Utility Sequential Patterns
The paper formalizes low-utility sequential pattern mining and proposes three algorithms (LUSPM_b baseline, LUSPM_s with shrinkage, LUSPM_e with extension) that use a sequence-utility chain and pruning to efficiently find all such patterns.