An Efficient Parallel Algorithm for Mining Frequent Sequences

Discovery of sequential patterns is becoming increasingly essential in data mining field. 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 complexity analysis of the algorithm is given. Our experiment shows that these two algorithms are capable of achieving good speedups. However, the task parallel formulation is more scalable than the data parallel one.