一种基于MaxGap约束的高效序列模式挖掘算法

如何有效地将约束与挖掘过程结合，将是提高基于约束的序列模式发现算法效率的关键。本文针对一种典型的强约束形式--MaxGap约束，提出了一种有效的序列模式挖掘方法。该方法利用MaxGap约束的特点，采用了高效的扩展单项剪枝策略，有效地减小了搜索空间的大小，提高了挖掘效率。实验结果表明，本文方法在性能上明显优于现有的方法。

An Efficient Sequential Pattern Mining Algorithm Based on the MaxGap Constraint

How to integrate them constraints the mining process is the key to improving the efficiency of the sequential pattern mining algorithm. Aiming at a typical constraint type MaxGap, this paper proposes an effective sequential pattern mining method. This method utilizes the characteristics of the MaxGap constraint, and adopts an efficient strategy to prune ineffective expansion items to reduce the size of search space, and thus the mining efficiency is improved. Experimental results show that the performance of our method is apparently better than that of the existing ones.