Towards Efficient Mining of Periodic-Frequent Patterns in Transactional Databases

Periodic-frequent patterns are an important class of regularities which exists in a transactional database. A frequent pattern is called periodic-frequent if it appears at regular intervals in a transactional database. In the literature, a model of periodic-frequent patterns was proposed and pattern growth like approaches to extract patterns are being explored. In these approaches, a periodic-frequent pattern tree is built in which a transaction-id list is maintained at each path's tail-node. As the typical size of transactional database is very huge in the modern e-commerce era, extraction of periodic-frequent patterns by maintaining transaction-ids in the tree requires more memory. In this paper, to reduce the memory requirements, we introduced a notion of period summary by capturing the periodicity of the patterns in a sequence of transaction-ids. While building the tree, the period summary of the transactions is computed and stored at the tail-node of the tree instead of the transaction-ids. We have also proposed a merging framework for period summaries for mining periodic-frequent patterns. The performance could be improved significantly as the memory required to store the period summaries is significantly less than the memory required to store the transaction-id list. Experimental results show that the proposed approach reduces the memory consumption significantly and also improves the runtime efficiency considerably over the existing approaches.

[1]  Philippe Lenca,et al.  Mining Periodic-Frequent Itemsets with Approximate Periodicity Using Interval Transaction-Ids List Tree , 2010, 2010 Third International Conference on Knowledge Discovery and Data Mining.

[2]  Kevin Y. Yip,et al.  Mining periodic patterns with gap requirement from sequences , 2007 .

[3]  P. Krishna Reddy,et al.  An Alternative Interestingness Measure for Mining Periodic-Frequent Patterns , 2011, DASFAA.

[4]  Geert Wets,et al.  Using association rules for product assortment decisions: a case study , 1999, KDD '99.

[5]  P. Krishna Reddy,et al.  Mining Rare Association Rules in the Datasets with Widely Varying Items' Frequencies , 2010, DASFAA.

[6]  Ho-Jin Choi,et al.  Efficient Mining Regularly Frequent Patterns in Transactional Databases , 2012, DASFAA.

[7]  Geert Wets,et al.  A data mining framework for optimal product selection in retail supermarket data: the generalized PROFSET model , 2000, KDD '00.

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

[9]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[10]  Wynne Hsu,et al.  Mining association rules with multiple minimum supports , 1999, KDD '99.

[11]  Young-Koo Lee,et al.  Discovering Periodic-Frequent Patterns in Transactional Databases , 2009, PAKDD.

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

[13]  Eamonn J. Keogh,et al.  HOT SAX: efficiently finding the most unusual time series subsequence , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[14]  Philippe Lenca,et al.  Mining Top-K Periodic-Frequent Pattern from Transactional Databases without Support Threshold , 2009, IAIT.

[15]  P. Krishna Reddy,et al.  An improved multiple minimum support based approach to mine rare association rules , 2009, 2009 IEEE Symposium on Computational Intelligence and Data Mining.

[16]  P. Krishna Reddy,et al.  An Improved Frequent Pattern-growth Approach to Discover Rare Association Rules , 2009, KDIR.

[17]  Yen-Liang Chen,et al.  Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism , 2004, Decision Support Systems.