Mining inter-sequence patterns with Itemset constraints

Nowadays, raw data is rarely used directly. In real world applications, data is often processed, and the necessary knowledge extracted, depending on the purpose of the user. Applying constraints in pattern mining is a major factor in reducing the resulting patterns to help decision support systems work efficiently. In 2018, a constraint-based approach was developed to discover inter-sequence patterns. However, this method only focused on the constraints with single items. The task of discovering constraint-based inter-sequential patterns is our target in this work. We propose the DBV-ISPMIC algorithm, a DBV-PatternList based structure, for mining inter-sequential patterns with itemset constraints. The proposed algorithm utilizes an organized search tree structure stored as dynamic bit vectors to quickly compute the support of patterns. In addition, we also develop a property and, based on it, an improved algorithm is proposed to reduce checking candidates. Finally, we develop the p DBV-ISPMIC algorithm as a parallel method of the DBV-ISPMIC algorithm. Empirical evaluations show that DBV-ISPMIC has better performance than the post-processing algorithms in experimental databases and p DBV-ISPMIC is better than DBV-ISPMIC with regard to the runtime.