Mining Quantitative Top-k Sequential Patterns under Constraints
Résumé
Abstract Sequential pattern mining with quantitative attributes is essential in many real-world applications where items are associated with numerical values such as quantities, dosages, or utilities. While numerous algorithms have been proposed for frequent or top-k sequential pattern mining, none simultaneously address top-k extraction, quantitative constraints, and flexible user-defined constraints within a unified framework. In this paper, we introduce a novel Constraint Programming (CP) model for mining top-k quantitative sequential patterns under heterogeneous constraints. Our approach relies on a global constraint that enforces both subsequence embedding and frequency filtering through dynamic support raising. We propose two dedicated search strategies that accelerate convergence toward the k most frequent patterns while progressively pruning the search space. Extensive experiments on real-world datasets demonstrate that our approach scales favorably compared to state-of-the-art top-k sequential pattern mining algorithms in terms of scalability and flexibility, while naturally supporting complex structural and quantitative constraints.
Citer ce document
Exporter : BibTeX · RIS (Zotero, Mendeley, EndNote)
Accès au document
Texte intégral archivé sur SPHAERO, en accès ouvert : lisible gratuitement en ligne après connexion. Le document reste aussi disponible à sa source. Se connecter
Voir l'article sur le site de la revueLicence et provenance
Licence : CC BY
Notice moissonnée depuis OpenAlex le 16/11/2026. Le document reste hébergé par sa source.
Voir le document à la source →