An improved parallel algorithm for sequence mining

It is more and more important in data mining field to finding the frequent sequences in a large database. The paper briefly introduces the basic concept of frequent sequence mining and presents the data parallel formulation and task parallel formulation of tree-projection based algorithm. Moreover, the on-line LPT algorithm is used to successfully solve the problem of imbalance for the task parallel formulation. Our experiment shows that these algorithms are capable of achieving good speedups. However, the task parallel formulation is more scalable than the data parallel one.