Discovering partial periodic-frequent patterns in a transactional database

Proposed a novel model to find partial periodic-frequent patterns in a database.Introduced a measure to find partial periodic-frequent patterns in a database.An efficient pruning technique has been proposed to reduce the computational cost.Described a pattern-growth algorithm to find all partial periodic-frequent patternsExperimental results show that our model is efficient. Time and frequency are two important dimensions to determine the interestingness of a pattern in a database. Periodic-frequent patterns are an important class of regularities that exist in a database with respect to these two dimensions. Current studies on periodic-frequent pattern mining have focused on discovering full periodic-frequent patterns, i.e., finding all frequent patterns that have exhibited complete cyclic repetitions in a database. However, partial periodic-frequent patterns are more common due to the imperfect nature of real-world. This paper proposes a flexible and generic model to find partial periodic-frequent patterns. A new interesting measure, periodic-ratio, has been introduced to determine the periodic interestingness of a frequent pattern by taking into account its proportion of cyclic repetitions in a database. The proposed patterns do not satisfy the anti-monotonic property. A novel pruning technique has been introduced to reduce the search space effectively. A pattern-growth algorithm to find all partial periodic-frequent patterns has also been presented in this paper. Experimental results demonstrate that the proposed model can discover useful information, and the algorithm is efficient.

[1]  Jiawei Han,et al.  Mining Segment-Wise Periodic Patterns in Time-Related Databases , 1998, KDD.

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

[3]  Jiawei Han,et al.  Frequent pattern mining: current status and future directions , 2007, Data Mining and Knowledge Discovery.

[4]  H. Stormer.  Improving E-Commerce Recommender Systems by the Identification of Seasonal Products , 2007 .

[5]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

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

[7]  Heikki Mannila,et al.  Methods and Problems in Data Mining , 1997, ICDT.

[8]  Philip S. Yu,et al.  Mining Asynchronous Periodic Patterns in Time Series Data , 2003, IEEE Trans. Knowl. Data Eng..

[9]  Jiawei Han,et al.  Efficient mining of partial periodic patterns in time series database , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[10]  Gediminas Adomavicius,et al.  Expert-Driven Validation of Rule-Based User Models in Personalization Applications , 2004, Data Mining and Knowledge Discovery.

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

[12]  Walid G. Aref,et al.  On the Discovery of Weak Periodicities in Large Time Series , 2002, PKDD.

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

[14]  Gediminas Adomavicius,et al.  Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.

[15]  Mohammed J. Zaki,et al.  Efficiently mining maximal frequent itemsets , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[16]  Jiawei Han,et al.  Mining top-k frequent closed patterns without minimum support , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[17]  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).

[18]  Toyoaki Nishida,et al.  Approximately Recurring Motif Discovery Using Shift Density Estimation , 2013, IEA/AIE.

[19]  P. Krishna Reddy,et al.  Towards Efficient Mining of Periodic-Frequent Patterns in Transactional Databases , 2016, DEXA.

[20]  Tim Oates,et al.  PERUSE: An unsupervised algorithm for finding recurring patterns in time series , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[21]  John F. Roddick,et al.  Sequential pattern mining -- approaches and algorithms , 2013, CSUR.

[22]  Mohammed J. Zaki,et al.  Efficient algorithms for mining closed itemsets and their lattice structure , 2005, IEEE Transactions on Knowledge and Data Engineering.

[23]  Masaru Kitsuregawa,et al.  Discovering Recurring Patterns in Time Series , 2015, EDBT.

[24]  P. S. Sastry,et al.  A fast algorithm for finding frequent episodes in event streams , 2007, KDD '07.

[25]  Sridhar Ramaswamy,et al.  Cyclic association rules , 1998, Proceedings 14th International Conference on Data Engineering.

[26]  P. Krishna Reddy,et al.  Extracting Diverse Patterns with Unbalanced Concept Hierarchy , 2014, PAKDD.

[27]  Masaru Kitsuregawa,et al.  Novel Techniques to Reduce Search Space in Periodic-Frequent Pattern Mining , 2014, DASFAA.

[28]  Carlos Agón,et al.  Time-series data mining , 2012, CSUR.

[29]  Jinyan Li,et al.  Efficient mining of emerging patterns: discovering trends and differences , 1999, KDD '99.

[30]  Shih-Sheng Chen,et al.  New and efficient knowledge discovery of partial periodic patterns with multiple minimum supports , 2011, J. Syst. Softw..

[31]  Nikos Mamoulis,et al.  Discovering Partial Periodic Patterns in Discrete Data Sequences , 2004, PAKDD.

[32]  P. Krishna Reddy,et al.  An Efficient Approach to Mine Periodic-Frequent Patterns in Transactional Databases , 2011, PAKDD Workshops.

[33]  Masaru Kitsuregawa,et al.  Efficient discovery of periodic-frequent patterns in very large databases , 2016, J. Syst. Softw..

[34]  Cory J. Butz,et al.  A Foundational Approach to Mining Itemset Utilities from Databases , 2004, SDM.

[35]  Joseph L. Hellerstein,et al.  Mining partially periodic event patterns with unknown periods , 2001, Proceedings 17th International Conference on Data Engineering.

[36]  Laks V. S. Lakshmanan,et al.  Pushing Convertible Constraints in Frequent Itemset Mining , 2004, Data Mining and Knowledge Discovery.

[37]  Xijin Tang,et al.  Text clustering using frequent itemsets , 2010, Knowl. Based Syst..

[38]  Walid G. Aref,et al.  Incremental, online, and merge mining of partial periodic patterns in time-series databases , 2004, IEEE Transactions on Knowledge and Data Engineering.