Abstract
Privacy-Preserve Utility Mining is becoming a topic of interest to many researchers. The goal is to protect the sensitive-high utility itemsets in the transaction databases from being exploited by data mining techniques. This paper studies methods to hide sensitive high utility itemsets in transaction databases. There are some effective methods to deal with this problem, but these methods still cause undesirable side effects, such as: being missing hidden itemsets with non-sensitive high utility itemsets, the difference between the original database and the modified database, etc. This paper proposed an improved algorithm for hiding sensitive high utility itemsets, called IEHSHUI, focus on choosing the order to hide sensitive itemsets and selecting items to modify with minimal side effects. Experimental results show that the IEHSHUI proposed algorithm is more efficient than existing algorithms in terms of execution time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data (2000)
Atallah, M., et al.: Disclosure limitation of sensitive rules. In: Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX1999) (Cat. No. PR00453). IEEE (1999)
Fournier‐Viger, P., et al.: A survey of itemset mining. Wiley Interdiscipl. Rev. Data Min. Knowl. Discov. 7(4), e1207 (2017)
Huynh Trieu, V., Le Quoc, H., Truong Ngoc, C.: An efficient algorithm for hiding sensitive-high utility itemsets. Intell. Data Anal. 24(4), 831–845 (2020)
Krishnamoorthy, S.: Pruning strategies for mining high utility itemsets. Expert Syst. Appl. 42(5), 2371–2381 (2015)
Lin, C.-W., et al.: A GA-based approach to hide sensitive high utility itemsets. Sci. World J. 2014 (2014)
Lin, J.C.-W., et al.: Fast algorithms for hiding sensitive high-utility itemsets in privacy-preserving utility mining. Eng. Appl. Artif. Intell. 55, 269–284 (2016)
Liu, X., Wen, S., Zuo, W.: Effective sanitization approaches to protect sensitive knowledge in high-utility itemset mining. Appl. Intell. 50(1), 169–191 (2019). https://doi.org/10.1007/s10489-019-01524-2
Mendes, R., Vilela, J.P.: Privacy-preserving data mining: methods, metrics, and applications. IEEE Access 5, 10562–10582 (2017)
O’Leary, D.E.: Knowledge discovery as a threat to database security. Knowl. Discov. Database 9, 507–516 (1991)
Rajalaxmi, R., Natarajan, A.: Effective sanitization approaches to hide sensitive utility and frequent itemsets. Intell. Data Anal. 16(6), 933–951 (2012)
Saravanabhavan, C., Parvathi, R.: Privacy preserving sensitive utility pattern mining. J. Theor. Appl. Inf. Technol. 49(2) (2013)
Selvaraj, R., Kuthadi, V.M.: A modified hiding high utility item first algorithm (HHUIF) with item selector (MHIS) for hiding sensitive itemsets. Int. J. Innov. Comput. Inf. Contrl. 9, 4851–4862 (2013)
Vo, B., et al.: An efficient method for hiding high utility itemsets. In: KES-AMSTA (2013)
Yeh, J.-S., Hsu, P.-C.: HHUIF and MSICF: Novel algorithms for privacy preserving utility mining. Expert Syst. Appl. 37(7), 4779–4786 (2010)
Yun, U., Kim, J.: A fast perturbation algorithm using tree structure for privacy preserving utility mining. Expert Syst. Appl. 42(3), 1149–1165 (2015)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Chien, N.K., Trang, D.T.K. (2021). An Improved Algorithm to Protect Sensitive High Utility Itemsets in Transaction Database. In: Cong Vinh, P., Huu Nhan, N. (eds) Nature of Computation and Communication. ICTCC 2021. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 408. Springer, Cham. https://doi.org/10.1007/978-3-030-92942-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-92942-8_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-92941-1
Online ISBN: 978-3-030-92942-8
eBook Packages: Computer ScienceComputer Science (R0)