Abstract
Today, people can use various database techniques to discover useful knowledge from large collections of data. However, people also face the risk of disclosing sensitive information to competitor when the data is shared between different organizations. Thus, there is a balance between the legitimate mining need and protection of confidential knowledge when people release or share data. In this paper, we study the privacy preserving in association rule mining. A new distortion-based method was proposed which hides sensitive rules by removing some items in database so as to reduce the support or confidence of sensitive rules below specified thresholds. Aimed at minimizing side effects, the number of sensitive rules and the number of non-sensitive rules supported by each transaction are utilized to sort the transactions and the candidates which contain most sensitive rules and least non-sensitive rules are selected to modify. Comparative experiments on real datasets showed that the new method can achieve satisfactory results with fewer side effects and data loss.
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
Preview
Unable to display preview. Download preview PDF.
References
Verykios, V.S., Elmagarmid, A.K., et al.: Association rule hiding. IEEE Transactions Knowledge and Data Engineering 16(4), 434–447 (2004)
Atallah, M.B.E., Elmagarmid, A., Ibrahim, M., Verykios, V.S.: Disclosure limitation of sensitive rules. In: Proceedings of IEEE Workshop on Knowledge and Data Engineering Exchange, Chicago, IL, pp. 45–52 (1999)
Dasseni, E., Verykios, V.S., Elmagarmid, A.K., Bertino, E.: Hiding association rules by using confidence and support. In: Proceedings of the 4th International Workshop on Information Hiding, pp. 369–383 (2001)
Wu, Y.H., Chiang, C.C., Chen, A.L.P.: Hiding sensitive association rules with limited side effects. IEEE Transactions Knowledge and Data Engineering 19(1), 29–42 (2007)
Oliveira, S.R.M., Zaïane, O.R.: Privacy preserving frequent itemset mining. In: Proceedings of IEEE International Conference on Privacy, Security and Data Mining, Australia, pp. 43–54 (2002)
Amiri, A.: Dare to share: Protecting sensitive knowledge with data sanitization. Decision Support Systems 43(1), 181–191 (2007)
Verykios, V.S.: Association rule hiding methods. Wiley Interdisc. Rew.: Data Mining and Knowledge Discovery 3(1), 28–36 (2013)
Sathiyapriya, K., Sadasivam, G.S.: A Survey on privacy preserving association rule mining. International Journal of Data Mining & Knowledge Management Process (IJDKP) 3(2) (March 2013)
Hong, T.P., Lin, C.W., Yang, K.T., Wang, S.L.: Using TF-IDF to hide sensitive itemsets. Applied Intelligence 38(4), 502–510 (2013)
Agrawal, R., Imielinski, T., Sawmi, A.: Mining association rules between sets of items in large databases. In: Proceedings of the ACM SIGMOD Conference on Management of Data (SIGMOD), pp. 207–216 (1993)
Agrawal, R., Srikant, R.: Fast algorithm for mining association rules. In: Proceedings of the International Conference on Very Large Data Bases (VLDB), pp. 487–499 (1994)
Bodon, F.: Surprising results of trie-based FIM algorithms. In: Proceedings of IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI 2004), Brighton, UK (2004)
Bodon, F.: A fast APRIORI implementation. In: IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI 2003), Melbourne, Florida, USA (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Cheng, P., Chu, SC., Lin, CW., Roddick, J.F. (2014). Distortion-Based Heuristic Sensitive Rule Hiding Method – The Greedy Way. In: Ali, M., Pan, JS., Chen, SM., Horng, MF. (eds) Modern Advances in Applied Intelligence. IEA/AIE 2014. Lecture Notes in Computer Science(), vol 8481. Springer, Cham. https://doi.org/10.1007/978-3-319-07455-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-07455-9_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07454-2
Online ISBN: 978-3-319-07455-9
eBook Packages: Computer ScienceComputer Science (R0)