Abstract
Nowadays, databases are shared commonly in various types between companies and organizations. The essential requirement is to release aggregate information about the data, without leaking individual information about participants. So the Privacy Preserving Data Mining (PPDM) has become an important research topic in recent years. PPDM models are applied commonly on hiding association rule, hiding high utility itemsets mining and also on hiding High Utility Sequential Patterns (HUSPs) mining. The goal of hiding utility sequential patterns is to find the way to hide all HUSPs so that the adversaries cannot mine them from the sanitized database. The exiting researches hasn’t considered in details about the difference ratio between the original database and the sanitized database after hiding all HUSPs. To address this issue, this paper presents two algorithms, which are HHUSP-D and HHUSP-A (Hiding High Utility Sequential Pattern by Descending and Ascending order of utility) to decrease the difference and also decrease execution time. In the proposed algorithms, a additional step is added to the exiting algorithm, HHUSP, to rearrange the hiding order of the HUSPs. Experimental results show that HHUSP-D is better performance than HHUSP [4] not only on the difference but also on the execution time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ahmed, C.F., et al.: A novel approach for mining high-utility sequential patterns in sequence databases. Electron. Telecommun. Res. Inst. J. 32(5), 676–686 (2010)
Aris, G.D., et al.: Revisiting sequential pattern hiding to enhance utility. In: KDD 2011 Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1316–1324 (2011)
Vo, B., et al.: An efficient method for hiding high utility itemsets. In: KES-AMSTA 2013, Hue, Vietnam, pp. 356–363. IOS-Press (2013)
Dinh, T., Nguyen, Q.M., Le, B.: A novel approach for hiding high utility sequential patterns. In: Proceedings of The Sixth International Symposium on Information and Communication Technology, Vietnam, pp. 121–128 (2015)
Jain, Y.K.: An efficient association rule hiding algorithm for privacy preserving data mining. Int. J. Comput. Sci. Eng. 3(7), 2792–2798 (2011)
Lan, G.C., et al.: Applying the maximum utility measure in high utility sequential pattern mining. Expert Syst. Appl. 41(11), 5071–5081 (2014)
Yeh, S., Hsu, P.C.: HHUIF and MSICF: novel algorithms for privacy preserving utility mining. Expert Syst. Appl. 37(7), 4779–4786 (2010)
Yin, J., et al.: USpan: an efficient algorithm for mining high utility sequential patterns. In: The 18th ACM SIGKDD, pp. 660–668 (2012)
An Open-Source Data Mining Library. http://www.philippe-fournier-viger.com/spmf/index.php. Accessed July 1 2016
Acknowledgment
This research is funded by Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 102.05-2015.07.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Quang, M.N., Huynh, U., Dinh, T., Le, N.H., Le, B. (2016). An Approach to Decrease Execution Time and Difference for Hiding High Utility Sequential Patterns. In: Huynh, VN., Inuiguchi, M., Le, B., Le, B., Denoeux, T. (eds) Integrated Uncertainty in Knowledge Modelling and Decision Making. IUKM 2016. Lecture Notes in Computer Science(), vol 9978. Springer, Cham. https://doi.org/10.1007/978-3-319-49046-5_37
Download citation
DOI: https://doi.org/10.1007/978-3-319-49046-5_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49045-8
Online ISBN: 978-3-319-49046-5
eBook Packages: Computer ScienceComputer Science (R0)