The aim of mining High Utility Sequential Patterns (HUSPs) is to discover sequential patterns having a high utility (e.g. high profit) based on a user-specified minimum utility threshold. The existing algorithms for mining HUSPs are capable of discovering the complete set of all HUSPs. However, they usually generate a large number of patterns which may be redundant in some cases. The periodic appearance of HUSPs can be regarded as an important criterion to consider the purchase behaviour of customers and measure the interestingness of HUSPs which is very common in real-life applications. In this paper, we focus on periodic high utility sequential patterns (PHUSPs) that are periodically bought by customers and generate a high profit. We proposed an algorithm named PHUSPM (Periodic High Utility Sequential Patterns Miner) to efficiently discover all PHUSPs. The experimental evaluation was performed on six large-scale datasets to evaluate the performance of PHUSPM in terms of execution time, memory usages and scalability. The experimental results show that the PHUSPM algorithm is very efficient by reducing the search space and discarding a considerable amount of non-PHUSPs.
[1]
Philippe Fournier-Viger,et al.
PHM: Mining Periodic High-Utility Itemsets
,
2016,
ICDM.
[2]
Antonio Gomariz,et al.
SPMF: a Java open-source pattern mining library
,
2014,
J. Mach. Learn. Res..
[3]
Masaru Kitsuregawa,et al.
Efficient discovery of periodic-frequent patterns in very large databases
,
2016,
J. Syst. Softw..
[4]
Longbing Cao,et al.
USpan: an efficient algorithm for mining high utility sequential patterns
,
2012,
KDD.
[5]
Young-Koo Lee,et al.
Discovering Periodic-Frequent Patterns in Transactional Databases
,
2009,
PAKDD.
[6]
P. Krishna Reddy,et al.
An Efficient Approach to Mine Periodic-Frequent Patterns in Transactional Databases
,
2011,
PAKDD Workshops.