Mining high utility partial periodic pattern by GPA

Different from full periodic patterns, partial periodic patterns could ignore the occurrence of some events in time positions. In this paper, we have presented a gradually pruning algorithm (GPA) for reducing the number of candidate patterns in the mining process. It is based on the two-phased periodic utility upper-bound (PUUB) model and could avoid information loss. Compared to the original approach without gradually pruning, the one proposed here could reduce the execution time but get the same desired results.

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

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

[3]  Qiang Yang,et al.  Mining high utility itemsets , 2003, Third IEEE International Conference on Data Mining.

[4]  Tzung-Pei Hong,et al.  Projection-based partial periodic pattern mining for event sequences , 2013, Expert Syst. Appl..

[5]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[6]  Chia-Hui Chang,et al.  Mining Periodic Patterns in Sequence Data , 2004, DaWaK.

[7]  Ying Liu,et al.  A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets , 2005, PAKDD.

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

[9]  A. Choudhary,et al.  A fast high utility itemsets mining algorithm , 2005, UBDM '05.

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

[11]  Raj P. Gopalan,et al.  CTU-Mine: An Efficient High Utility Itemset Mining Algorithm Using the Pattern Growth Approach , 2007, 7th IEEE International Conference on Computer and Information Technology (CIT 2007).

[12]  Philip S. Yu,et al.  UP-Growth: an efficient algorithm for high utility itemset mining , 2010, KDD.

[13]  Vincent S. Tseng,et al.  FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning , 2014, ISMIS.

[14]  Tzung-Pei Hong,et al.  AN EFFICIENT GRADUAL PRUNING TECHNIQUE FOR UTILITY MINING , 2012 .

[15]  Jiawei Han,et al.  BIDE: efficient mining of frequent closed sequences , 2004, Proceedings. 20th International Conference on Data Engineering.

[16]  Unil Yun,et al.  Efficient High Utility Pattern Mining for Establishing Manufacturing Plans With Sliding Window Control , 2017, IEEE Transactions on Industrial Electronics.

[17]  Tzung-Pei Hong,et al.  High Utility Partial Periodic Pattern Mining , 2017, MISNC '17.

[18]  Tzung-Pei Hong,et al.  An incremental mining algorithm for high utility itemsets , 2012, Expert Syst. Appl..

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

[20]  R. Suganya,et al.  Data Mining Concepts and Techniques , 2010 .

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

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

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

[24]  Tzung-Pei Hong,et al.  Efficient algorithms for mining high-utility itemsets in uncertain databases , 2016, Knowl. Based Syst..