FMGSP: An Efficient Method of Mining Global Sequential Patterns

Now some distributed sequential patterns mining algorithms generate too many candidate sequences, and increase communication overhead. Therefore, we propose an efficient algorithm-FMGSP (fast mining of global sequential patterns) of mining global sequential pattern on distributed system. Our method of mining sequential pattern in distributed environment differs from previous related works. Two main contributions are made in this paper. First local sequential patterns obtained on every site in distributed environment are compressed into a lexicographic sequence tree before all subtrees will be distributed into polling site, Second, an efficient pruning strategy called I/S-EP (item and sequence extension pruning) is proposed to reduce candidate sequences. Just this, the cost of communication in the network is reduced greatly when counting requests are sent (or received) to the corresponding databases. Both theories and experiments indicate that the performance of FMGSP is predominant for large databases, the global sequential patterns could be obtained effectively by the method after reducing the cost of communication.