Mining Non-redundant Periodic Frequent Patterns

Discovering periodic frequent patterns has been useful in various decision making. Traditional algorithms, however, often report a large number of such patterns, most of which are often redundant since their periodic occurrences can be inferred from other periodic frequent patterns. Employing such redundant periodic frequent patterns in decision making would often be detrimental if not trivial. To address this challenge and report only non-redundant periodic frequent patterns, this paper employs the concept of deduction rules in mining the set of non-redundant periodic frequent patterns. A Non-redundant Periodic Frequent Pattern Miner (NPFPM) is subsequently proposed to achieve this purpose. Experimental analysis on benchmark datasets show that NPFPM is efficient and can effectively prune the set of redundant periodic frequent patterns.

[1]  Geoffrey I. Webb.  Self-sufficient itemsets: An approach to screening potentially interesting associations between items , 2010, TKDD.

[2]  Fan-Chen Tseng,et al.  Mining frequent itemsets in large databases: The hierarchical partitioning approach , 2013, Expert Syst. Appl..

[3]  Vincent Mwintieru Nofong,et al.  Towards fast and memory efficient discovery of periodic frequent patterns , 2019, J. Inf. Telecommun..

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

[5]  Vincent Mwintieru Nofong.  Discovering Productive Periodic Frequent Patterns in Transactional Databases , 2016 .

[6]  Mohammed J. Zaki,et al.  Fast vertical mining using diffsets , 2003, KDD '03.

[7]  Masaru Kitsuregawa,et al.  Memory efficient mining of periodic-frequent patterns in transactional databases , 2016, 2016 IEEE Symposium Series on Computational Intelligence (SSCI).

[8]  Srinivasan Parthasarathy,et al.  Parallel Algorithms for Discovery of Association Rules , 1997, Data Mining and Knowledge Discovery.

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

[10]  Iqbal Gondal,et al.  Regularly Frequent Patterns Mining from Sensor Data Stream , 2013, ICONIP.

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

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

[13]  G VijayKumar,et al.  Incremental Mining for Regular Frequent Patterns in Vertical Format , 2013 .

[14]  Masaru Kitsuregawa,et al.  Discovering Quasi-Periodic-Frequent Patterns in Transactional Databases , 2013, BDA.

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

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

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

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

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

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

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

[22]  Jian Pei,et al.  Minimum Description Length Principle: Generators Are Preferable to Closed Patterns , 2006, AAAI.

[23]  AgrawalRakesh,et al.  Mining association rules between sets of items in large databases , 1993 .

[24]  Vincent Mwintieru Nofong,et al.  Fast and Memory Efficient Mining of Periodic Frequent Patterns , 2018, ACIIDS.

[25]  Giancarlo Fortino,et al.  Mining productive-periodic frequent patterns in tele-health systems , 2018, J. Netw. Comput. Appl..

[26]  Tzung-Pei Hong,et al.  A two-phase approach to mine short-period high-utility itemsets in transactional databases , 2017, Adv. Eng. Informatics.