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
本文介绍了使用Answer Set Programming(ASP)挖掘顺序模式。我们借助ASP对背景知识进行模式挖掘,提出了两种嵌入表示中经典顺序模式挖掘任务的编码,并对各种类型的模式比较了这些编码的计算性能。结果表明,fill-gaps策略在实际问题中的内存消耗较低。相较于约束编程方法(CPSM),我们的方案表现稳定。