PHM: Mining Periodic High-Utility Itemsets

High-utility itemset mining is the task of discovering high-utility itemsets, i.e. sets of items that yield a high profit in a customer transaction database. High-utility itemsets are useful, as they provide information about profitable sets of items bought by customers to retail store managers, which can then use this information to take strategic marketing decisions. An inherent limitation of traditional high-utility itemset mining algorithms is that they are inappropriate to discover recurring customer purchase behavior, although such behavior is common in real-life situations (for example, a customer may buy some products every day, week or month). In this paper, we address this limitation by proposing the task of periodic high-utility itemset mining. The goal is to discover groups of items that are periodically bought by customers and generate a high profit. An efficient algorithm named PHM (Periodic High-utility itemset Miner) is proposed to efficiently enumerate all periodic high-utility itemsets. Experimental results show that the PHM algorithm is efficient, and can filter a huge number of non periodic patterns to reveal only the desired periodic high-utility itemsets.

[1]  P. Krishna Reddy,et al.  Mining Rare Periodic-Frequent Patterns Using Multiple Minimum Supports , 2009, COMAD.

[2]  Antonio Gomariz,et al.  SPMF: a Java open-source pattern mining library , 2014, J. Mach. Learn. Res..

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

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

[5]  Tzung-Pei Hong,et al.  An efficient projection-based indexing approach for mining high utility itemsets , 2012, Knowledge and Information Systems.

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

[7]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[8]  Rupali A. Mahajan,et al.  Survey on Mining High Utility Itemset from Transactional Database , 2013 .

[9]  Vincent S. Tseng,et al.  Efficient Mining of High-Utility Sequential Rules , 2015, MLDM.

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

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

[12]  Philippe Fournier-Viger,et al.  FHM + : Faster High-Utility Itemset Mining Using Length Upper-Bound Reduction , 2016, IEA/AIE.

[13]  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.

[14]  Mengchi Liu,et al.  Mining high utility itemsets without candidate generation , 2012, CIKM.

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

[16]  Vincent S. Tseng,et al.  EFIM: A Highly Efficient Algorithm for High-Utility Itemset Mining , 2015, MICAI.

[17]  Yu Liu,et al.  BAHUI: Fast and Memory Efficient Mining of High Utility Itemsets Based on Bitmap , 2014, Int. J. Data Warehous. Min..

[18]  Philip S. Yu,et al.  Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases , 2013, IEEE Transactions on Knowledge and Data Engineering.