This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hiding Sensitive Association Rules with Limited Side Effects
January 2007 (vol. 19 no. 1)
pp. 29-42
Data mining techniques have been widely used in various applications. However, the misuse of these techniques may lead to the disclosure of sensitive information. Researchers have recently made efforts at hiding sensitive association rules. Nevertheless, undesired side effects, e.g., nonsensitive rules falsely hidden and spurious rules falsely generated, may be produced in the rule hiding process. In this paper, we present a novel approach that strategically modifies a few transactions in the transaction database to decrease the supports or confidences of sensitive rules without producing the side effects. Since the correlation among rules can make it impossible to achieve this goal, in this paper, we propose heuristic methods for increasing the number of hidden sensitive rules and reducing the number of modified entries. The experimental results show the effectiveness of our approach, i.e., undesired side effects are avoided in the rule hiding process. The results also report that in most cases, all the sensitive rules are hidden without spurious rules falsely generated. Moreover, the good scalability of our approach in terms of database size and the influence of the correlation among rules on rule hiding are observed.

[1] D. Agrawal and C.C. Aggarwal, “On the Design and Quantification of Privacy Preserving Data Mining Algorithms,” Proc. ACM Symp. Principles of Database Systems, pp. 247-255, 2001.
[2] R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules between Sets of Items in Large Databases,” Proc. ACM Conf. Management of Data, pp. 207-216, 1993.
[3] R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo, “Fast Discovery of Association Rules,” Advances in Knowledge Discovery and Data Mining, chapter 12, U.M. Fayyad etal., eds., AAAI/MIT Press, pp. 307-328, 1996.
[4] R. Agrawal and R. Srikant, “Fast Algorithms for Mining Association Rules,” Proc. Conf. Very Large Data Bases, pp. 487-499, 1994.
[5] R. Agrawal and R. Srikant, “Privacy-Preserving Data Mining,” Proc. ACM Conf. Management of Data, pp. 14-19, 2000.
[6] M. Atallah et al., “Disclosure Limitation of Sensitive Rules,” Proc. IEEE Workshop Knowledge and Data Eng. Exchange, pp. 45-52, 1999.
[7] C.M. Chiang, “A New Approach for Sensitive Rule Hiding by Considering Side Effects,” master thesis, Dept. of Computer Science, Nat'l Tsing Hua Univ., Republic of China, 2003.
[8] C. Clifton, “Protecting against Data Mining through Samples,” Proc. IFIP Conf. Database Security, pp. 193-207, 1999.
[9] C. Clifton and D. Marks, “Security and Privacy Implications of Data Mining,” Proc. ACM Workshop Research Issues in Data Mining and Knowledge Discovery, 1996.
[10] E. Dasseni, V.S. Verykios, A.K. Elmagarmid, and E. Bertino, “Hiding Association Rules by Using Confidence and Support,” Proc. Information Hiding Workshop, pp. 369-383, 2001.
[11] V. Estivill-Castro and L. Brankovic, “Data Swapping: Balancing Privacy against Precision in Mining for Logic Rules,” Proc. Conf. Data Warehousing and Knowledge Discovery, pp. 389-398, 1999.
[12] A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke, “Privacy Preserving Mining of Association Rules,” Information Systems, vol. 29, pp. 343-364, 2004.
[13] J. Han, J. Pei, Y. Yin, and R. Mao, “Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach,” Data Mining and Knowledge Discovery, vol. 8, no. 1, pp.53-87, 2004.
[14] V.S. Iyengar, “Transforming Data to Satisfy Privacy Constraints,” Proc. ACM Conf. Knowledge Discovery and Data Mining, pp. 279-288, 2002.
[15] M. Kantarcioglu and C. Clifton, “Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data,” Proc. ACM Workshop Research Issues in Data Mining and Knowledge Discovery, 2002.
[16] Information Storage and Retrieval Systems Theory and Implementation, G.J. Kowalski and M.T. Maybury, eds. Kluwer Academic Publishers, 1997.
[17] J. Liu, Y. Pan, K. Wang, and J. Han, “Mining Frequent Item Sets by Opportunistic Projection,” Proc. ACM Conf. Knowledge Discovery and Data Mining, 2002.
[18] S.R.M. Oliveira and O.R. Zaïne, “Privacy Preserving Frequent Itemset Mining,” Proc. IEEE ICDM Workshop Privacy, Security, and Data Mining, pp. 43-54, 2002.
[19] S.J. Rizvi and J.R. Haritsa, “Maintaining Data Privacy in Association Rule Mining,” Proc. Conf. Very Large Data Bases, pp.682-693, 2002.
[20] P. Samarati, “Protecting Respondents' Identities in Microdata Release,” IEEE Trans. Knowledge and Data Eng., vol. 13, no. 6, pp.1010-1027, 2001.
[21] Y. Saygin, V.S. Verykios, and C. Clifton, “Using Unknowns to Prevent Discovery of Association Rules,” ACM SIGMOD Record, vol. 30, no. 4, pp. 45-54, 2001.
[22] Y. Saygin, V.S. Verykios, and A.K. Elmagarmid, “Privacy Preserving Association Rule Mining,” Proc. IEEE Workshop Research Issues in Data Eng., 2002.
[23] J. Vaidya and C. Clifton, “Privacy Preserving Association Rule Mining in Vertically Partitioned Data,” Proc. ACM Conf. Knowledge Discovery and Data Mining, 2002.
[24] V.S. Verykios, A.K. Elmagarmid, E. Bertino, Y. Saygin, and E. Dasseni, “Association Rule Hiding,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 4, pp. 434-447, 2004.
[25] V.S. Verykios, E. Bertino, I.N. Fovino, L.P. Provenza, Y. Saygin, and Y. Theodoridis, “State-of-the-Art in Privacy Preserving Data Mining,” ACM SIGMOD Record, vol. 33, no. 1, 2004.
[26] S.J. Yen and A.L.P. Chen, “A Graph-Based Approach for Discovering Various Types of Association Rules,” IEEE Trans. Knowledge and Data Eng., vol. 13, no. 5, 2001.
[27] M.J. Zaki, “Scalable Algorithms for Association Mining,” IEEE Trans. Knowledge and Data Eng., vol. 12, no. 3, pp. 372-390, 2000.
[28] http://www.almaden.ibm.com/software/quest/ Resources index.shtml, 2003.

Index Terms:
Association rules, data mining, mining methods and algorithms, rule hiding.
Citation:
Yi-Hung Wu, Chia-Ming Chiang, Arbee L.P. Chen, "Hiding Sensitive Association Rules with Limited Side Effects," IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 1, pp. 29-42, Jan. 2007, doi:10.1109/TKDE.2007.11
Usage of this product signifies your acceptance of the Terms of Use.