An efficient tree-based algorithm for mining sequential patterns with multiple

An efficient tree-based algorithm for mining sequential patterns with multiple

Abstract— Mining frequent sequences is a step in the sequential patterns discovering, and sequential patterns mining is an important area of research in the field of data mining. If we use the traditional algorithms such as Apriori or GSP algorithm to discover the sequential patterns under the circumstance of the dynamic data changing,< Final Year Projects > since they need to scan the whole database for multiple times, and do not give the right information at the right time, so the results don’t reflect the current status, and the performances will become inefficient. In this paper, we present a new method for mining the frequent sequences in dynamic environment; the method is developed based on previous episodes mining results. It only needs to scan parts of the whole dataset based on the previous results for the whole frequent sequences mining at the end, and it only needs to scan the database only once in the special situation. Experimental results show that the performance of our algorithm outperforms the GPS algorithm very greatly.