A Fast Algorithm for Hiding High Utility Sequential Patterns

High utility sequential patterns (HUSPs) are common patterns that can be discovered from the data collected in many domains (e.g. retail, bioinformatics, mobile commerce). To extract these patterns, high utility sequential pattern mining (HUSPM) has been proposed in recent decade. Although the HUSPM algorithms provide us a special perspective to analyze the knowledge behind the collected data, it also arises the risk of the privacy leakage and underlying security issues. This leads to the emergence of high utility sequential pattern hiding (HUSPH) whose purpose is to hide all HUSPs in the sequence database under a specified threshold. Around this topic, many algorithms were proposed. However, the existing algorithms are very time-consuming, which makes them unable to process the real massive data quickly. In this paper, we propose an efficient algorithm named FH-HUSP (fast algorithm for hiding high utility sequential patterns) for HUSPH. Substantial experimental results show that the proposed algorithm can hide all high utility sequential patterns quickly under the specific minimum utility with relatively small modifications.

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

[2]  Yi-Cheng Chen,et al.  On efficiently mining high utility sequential patterns , 2016, Knowledge and Information Systems.

[3]  Philip S. Yu,et al.  Mining High Utility Mobile Sequential Patterns in Mobile Commerce Environments , 2011, DASFAA.

[4]  Van-Nam Huynh,et al.  An efficient algorithm for Hiding High Utility Sequential Patterns , 2018, Int. J. Approx. Reason..

[5]  Byeong-Soo Jeong,et al.  A Novel Approach for Mining High‐Utility Sequential Patterns in Sequence Databases , 2010 .

[6]  Jiun-Long Huang,et al.  Incremental Mining of High Utility Sequential Patterns in Incremental Databases , 2016, CIKM.

[7]  Pinar Senkul,et al.  CRoM and HuspExt: Improving Efficiency of High Utility Sequential Pattern Extraction , 2015, IEEE Transactions on Knowledge and Data Engineering.

[8]  Aijun An,et al.  Mining significant high utility gene regulation sequential patterns , 2017, BMC Systems Biology.

[9]  Yehuda Lindell,et al.  Privacy Preserving Data Mining , 2002, Journal of Cryptology.

[10]  Hoai Bac Le,et al.  MHHUSP: An integrated algorithm for mining and Hiding High Utility Sequential Patterns , 2016, 2016 Eighth International Conference on Knowledge and Systems Engineering (KSE).

[11]  Longbing Cao,et al.  Efficiently Mining Top-K High Utility Sequential Patterns , 2013, 2013 IEEE 13th International Conference on Data Mining.

[12]  Hoai Bac Le,et al.  An Approach to Decrease Execution Time and Difference for Hiding High Utility Sequential Patterns , 2016, IUKM.

[13]  Justin Zhijun Zhan,et al.  Fast algorithms for hiding sensitive high-utility itemsets in privacy-preserving utility mining , 2016, Eng. Appl. Artif. Intell..

[14]  Longbing Cao,et al.  USpan: an efficient algorithm for mining high utility sequential patterns , 2012, KDD.

[15]  Philip S. Yu,et al.  A General Survey of Privacy-Preserving Data Mining Models and Algorithms , 2008, Privacy-Preserving Data Mining.

[16]  Hoai Bac Le,et al.  A Novel Approach for Hiding High Utility Sequential Patterns , 2015, SoICT.