A global constraint for mining sequential patterns with GAP constraint
From MaRDI portal
Abstract: Sequential pattern mining (SPM) under gap constraint is a challenging task. Many efficient specialized methods have been developed but they are all suffering from a lack of genericity. The Constraint Programming (CP) approaches are not so effective because of the size of their encodings. In[7], we have proposed the global constraint Prefix-Projection for SPM which remedies to this drawback. However, this global constraint cannot be directly extended to support gap constraint. In this paper, we propose the global constraint GAP-SEQ enabling to handle SPM with or without gap constraint. GAP-SEQ relies on the principle of right pattern extensions. Experiments show that our approach clearly outperforms both CP approaches and the state-of-the-art cSpade method on large datasets.
Recommendations
- Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining
- scientific article; zbMATH DE number 2013272
- Mining time-constrained sequential patterns with constraint programming
- Constraint-Based Sequence Mining Using Constraint Programming
- Episodesupport: a global constraint for mining frequent patterns in a long sequence of events
Cited in
(5)- Episodesupport: a global constraint for mining frequent patterns in a long sequence of events
- Mining time-constrained sequential patterns with constraint programming
- Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining
- scientific article; zbMATH DE number 2013272 (Why is no real title available?)
- Constraint-Based Sequence Mining Using Constraint Programming
This page was built for publication: A global constraint for mining sequential patterns with GAP constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815106)