Mining Frequent Ordered Patterns without Candidate Generation

Mining frequent patterns is an important data mining task and has been widely studied. However, the traditional frequent pattern mining does not involve the ordered problem, which is widely exists in the real world. A lot of papers have been proposed to solve the ordered problem, including sequential pattern mining, item sequences mining, temporal feature extraction, web log study and ordered patterns mining. Most of these papers used an APRIORI-based algorithm hence did not adopt the wonderful ideas and advanced technologies in traditional frequent patterns mining. This paper introduced a data structure called FOP-tree which is a modified version of FP-tree to solve the ordered patterns mining. The performance study shows that the FOP-tree is efficient and scalable for mining both long and short frequent ordered patterns, and is much faster than the traditional APRIORI-bases algorithms on several situations.

[1]  Philip S. Yu,et al.  Efficient Data Mining for Path Traversal Patterns , 1998, IEEE Trans. Knowl. Data Eng..

[2]  Ferenc Bodon,et al.  A trie-based APRIORI implementation for mining frequent item sequences , 2005 .

[3]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD 2000.

[4]  Heikki Mannila,et al.  Discovering Frequent Episodes in Sequences , 1995, KDD.

[5]  Piotr Synak,et al.  Temporal Feature Extraction from Temporal Information Systems , 2003, ISMIS.

[6]  Mohammed J. Zaki.  Scalable Algorithms for Association Mining , 2000, IEEE Trans. Knowl. Data Eng..

[7]  Philip S. Yu,et al.  Data mining for path traversal patterns in a web environment , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[8]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[9]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

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

[11]  Shiwei Tang,et al.  Mining Frequent Ordered Patterns , 2005, PAKDD.

[12]  Walid G. Aref.  Mining Association Rules in Large Databases , 2004 .

[13]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.