Sequential Pattern Mining Using Apriori Algorithm & Frequent Pattern Tree Algorithm

The concept of Sequential Pattern Mining was first introduced by Rakesh Agrawal and Ramakrishnan Srikant in the year 1995. Sequential Patterns are used to discover sequential sub-sequences among large amount of sequential data. In web usage mining, sequential patterns are exploited to find sequential navigation patterns that appear in users' sessions sequentially. The information obtained from sequential pattern mining can be used in marketing, medical records, sales analysis, and so on. In this paper, a new algorithm is proposed; it combines the Apriori algorithm and FP-tree structure which proposed in FP-growth algorithm. The advantage of proposed algorithm is that it dosen't need to generate conditional pattern bases and sub- conditional pattern tree recursively. And the results of the experiments show that it works faster than Apriori.

[1]  Osmar R. Zaïane,et al.  COFI approach for mining frequent itemsets revisited , 2004, DMKD '04.

[2]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[3]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[4]  Jiawei Han,et al.  Discovery of Multiple-Level Association Rules from Large Databases , 1995, VLDB.

[5]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[6]  Hongjun Lu,et al.  H-mine: hyper-structure mining of frequent patterns in large databases , 2001, Proceedings 2001 IEEE International Conference on Data Mining.