TaSPM:目标序列模式挖掘
TaSPM: Targeted Sequential Pattern Mining
摘要:
序列模式挖掘(SPM)是模式挖掘的一种重要技术,在实际中有着广泛的应用。虽然已经提出了许多有效的序列模式挖掘算法,但针对目标序列的研究很少。有针对性地查询序列模式不仅可以减少SPM生成的序列数量,而且可以提高用户进行模式分析的效率。现有的靶向序列查询算法都是基于特定的场景,不能推广到其他应用。在本文中,我们制定了有针对性的序列模式挖掘的问题,并提出了一个通用的框架,即TaSPM,基于快速CM-SPAM算法。此外,为了提高TaSPM在大规模数据集和基于多项的序列数据集上的效率,我们提出了几种剪枝策略来减少挖掘过程中的无意义操作。TaSPM中设计了四种剪枝策略,能够快速终止不必要的模式扩展,获得更好的性能。最后,我们在不同的数据集上进行了广泛的实验,比较现有的SPM算法与TaSPM。实验结果表明,新的目标挖掘算法TaSPM可以实现更快的运行时间和更少的内存消耗。
英文摘要:
Sequential pattern mining (SPM) is an important technique of pattern mining, which has many applications in reality. Although many efficient sequential pattern mining algorithms have been proposed, there are few studies can focus on target sequences. Targeted querying sequential patterns can not only reduce the number of sequences generated by SPM, but also improve the efficiency of users in performing pattern analysis. The current algorithms available on targeted sequence querying are based on specific scenarios and cannot be generalized to other applications. In this paper, we formulate the problem of targeted sequential pattern mining and propose a generic framework namely TaSPM, based on the fast CM-SPAM algorithm. What's more, to improve the efficiency of TaSPM on large-scale datasets and multiple-items-based sequence datasets, we propose several pruning strategies to reduce meaningless operations in mining processes. Totally four pruning strategies are designed in TaSPM, and hence it can terminate unnecessary pattern extensions quickly and achieve better performance. Finally, we conduct extensive experiments on different datasets to compare the existing SPM algorithms with TaSPM. Experiments show that the novel targeted mining algorithm TaSPM can achieve faster running time and less memory consumption.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。