关键词: 数据挖掘 约束序列模式挖掘 偏序约束 含蓄分割

Abstract:

Constraints are essential for many sequential pattern mining apphcations. Ibis paper presents a new constraint called the partial order constraint, wh  ich allows the time duration between transactions to be infinite. But the duration can only be integer, so the partial order constraint can be considere  d to extend the duration constraint. An original algorithm called SPM（sequential pattern maintenance）is proposed. The SPM algorithm adopts an implicit  t segmentation technique which segments the dissatisfied constraint sequences from the existing ones, and makes full use of the information obtained fro m the previous mining processes to solve the case that the count of the support in DB becomes low because of the reduction of data sequences. The experi mental results show that our approach is fast and scalable.

Key words: （data mining, constraint sequential pattern mining, partial-order constraint, implicit segmentation）