HOVA-FPPM: Flexible Periodic Pattern Mining in Time Series Databases Using Hashed Occurrence Vectors and Apriori Approach

Finding flexible periodic patterns in a time series database is nontrivial due to irregular occurrence of unimportant events, which makes it intractable or computationally intensive for large datasets. There exist various solutions based on Apriori, projection, tree, and other techniques to mine these patterns. However, the existence of constant size tree structure, i.e., suffix tree, with extra information in memory throughout the mining process, redundant and invalid pattern generation, limited types of mined flexible periodic patterns, and repeated traversal over tree data structure for pattern discovery, results in unacceptable space and time complexity. In order to overcome these issues, we introduce an efficient approach called HOVA-FPPM based on Apriori approach with hashed occurrence vectors to find all types of flexible periodic patterns. We do not rely on complex tree structure rather manage necessary information in a hash table for efficient lookup during the mining process. We measured the performance of our proposed approach and compared the results with the baseline approach, i.e., FPPM. The results show that our approach requires lesser time and space, regardless of the data size or period value.

[1]  Salvatore Orlando,et al.  Fast and memory efficient mining of frequent closed itemsets , 2006, IEEE Transactions on Knowledge and Data Engineering.

[2]  Walid G. Aref,et al.  Multiple and Partial Periodicity Mining in Time Series Databases , 2002, ECAI.

[3]  Yun Sing Koh,et al.  A Survey of Sequential Pattern Mining , 2017 .

[4]  Ho-Jin Choi,et al.  Interactive mining of high utility patterns over data streams , 2012, Expert Syst. Appl..

[5]  Masaru Kitsuregawa,et al.  Discovering Periodic-Correlated Patterns in Temporal Databases , 2018, Trans. Large Scale Data Knowl. Centered Syst..

[6]  Johannes Gehrke,et al.  Sequential PAttern mining using a bitmap representation , 2002, KDD.

[7]  Manziba Akanda Nishi,et al.  Effective periodic pattern mining in time series databases , 2013, Expert Syst. Appl..

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

[9]  Miroslav Voznak,et al.  PFPM: Discovering Periodic Frequent Patterns with Novel Periodicity Measures , 2017 .

[10]  Masaru Kitsuregawa,et al.  Discovering Partial Periodic Itemsets in Temporal Databases , 2017, SSDBM.

[11]  Jiawei Han,et al.  Detecting Multiple Periods and Periodic Patterns in Event Time Sequences , 2017, CIKM.

[12]  Piotr Indyk,et al.  Identifying Representative Trends in Massive Time Series Data Sets Using Sketches , 2000, VLDB.

[13]  Jiawei Han,et al.  TSP: Mining top-k closed sequential patterns , 2004, Knowledge and Information Systems.

[14]  Lisheng Ma,et al.  An Efficient Algorithm for Frequent Closed Itemsets Mining , 2008, 2008 International Conference on Computer Science and Software Engineering.

[15]  Mohammed Al-Shalalfa,et al.  Efficient Periodicity Mining in Time Series Databases Using Suffix Trees , 2011, IEEE Transactions on Knowledge and Data Engineering.

[16]  Y. Srinivas,et al.  Efficient High-Utility Itemset Mining Over Variety of Databases: A Survey , 2018, Soft Computing in Data Analytics.

[17]  Jiawei Han,et al.  CoMine: efficient mining of correlated patterns , 2003, Third IEEE International Conference on Data Mining.

[18]  Philip S. Yu,et al.  InfoMiner+: mining partial periodic patterns with gap penalties , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[19]  Ho-Jin Choi,et al.  A framework for mining interesting high utility patterns with a strong frequency affinity , 2011, Inf. Sci..

[20]  Anthony J. T. Lee,et al.  Mining closed flexible patterns in time-series databases , 2010, Expert Syst. Appl..

[21]  Manziba Akanda Nishi,et al.  An efficient approach to mine flexible periodic patterns in time series databases , 2015, Eng. Appl. Artif. Intell..

[22]  Walid G. Aref,et al.  WARP: time warping for periodicity detection , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[23]  Tak-Chung Fu,et al.  A review on time series data mining , 2011, Eng. Appl. Artif. Intell..

[24]  Philip S. Yu,et al.  A Periodicity-based Parallel Time Series Prediction Algorithm in Cloud Computing Environments , 2018, Inf. Sci..

[25]  Mukesh Patel,et al.  A comprehensive study on periodicity mining algorithms , 2016, 2016 International Conference on Global Trends in Signal Processing, Information Computing and Communication (ICGTSPICC).

[26]  Esko Ukkonen,et al.  On-line construction of suffix trees , 1995, Algorithmica.

[27]  Yves Lemieux,et al.  Detection of time series patterns and periodicity of cloud computing workloads , 2020, Future Gener. Comput. Syst..

[28]  Bay Vo,et al.  An efficient method for mining frequent itemsets with double constraints , 2014, Eng. Appl. Artif. Intell..

[29]  Carson K. Leung,et al.  A new framework for mining weighted periodic patterns in time series databases , 2017, Expert Syst. Appl..

[30]  Hua Yuan,et al.  Efficient Mining of Event Periodicity in Data Series , 2019, DASFAA.

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

[32]  Chowdhury Farhan Ahmed,et al.  Mining non-redundant closed flexible periodic patterns , 2018, Eng. Appl. Artif. Intell..

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