Open Access Open Access  Restricted Access Subscription or Fee Access

An Innovative Approach for Privacy Preserving the Identified Sensitive Rules

Mahmoud M. Ismail, Shawkat K. Guirguis, Mohamed M. Abo rizka


as data mining become more pervasive, privacy becomes one of the prime concerns in data mining research community. This, however, increases risks of disclosing the sensitive knowledge when the database is released to other peers and rivals. Therefore, privacy concerns force companies or competitors to be reluctant or unwilling to share their real data for collaboration to get mutual benefits. Many researchers proposed many methodologies to face the privacy issues in association rule mining by a sanitization process which transforms the source database into a released database called sanitized database to conceal sensitive rules. The sanitization process also conceals non sensitive information as an undesired event, called a side effect or the misses cost that affects data utility of the sanitized database. The challenge is to minimize the side effect on the sanitized database so that non sensitive knowledge can still be mined. This paper proposes an innovative approach to hide the sensitive frequent itemsets that may lead to the production of the selected identified sensitive rules "Statistically Significant Strongly Positive Correlation Rules"(SSSPCRH) by data owner. The proposed novel algorithm CIIEBE (Computing Impact of Inevitable and Evitable Border Elements) suggested three efficiently criterions to identify the relevant victim item, to select transaction(s) to be evaluated and relevant transaction(s) to be modified with minimal impact on positive border set rather than considering all non sensitive itemsets during the sanitization process. So that side effects can be fully avoided or accepting few side effects which will not harm data utility. The proposed algorithm suggests a set of metrics as well as new metrics to evaluate the effectiveness and efficiency; experimental results demonstrate that the proposed algorithm can achieve minimal side effects than those achieved by FHSFI, maxcover and spmaxFI algorithms in several real and artificial datasets.


Data Mining, Privacy Preserving Data Mining, Sensitive Rules, Data Sanitization, Sensitive Itemset Hiding.

Full Text:



D. E. O. Leary, “Knowledge Discovery as a Threat to Database Security,” Knowledge Discovery in Databases, pp. 507–516, 1991.

N. Zhang, W. Zhao, “Privacy-preserving data mining systems,” IEEE Computer Society, vol. 40, issue 4, pp. 52-58, 2007.

Dev H., Tanmoy S., Madhusudan B., and Mohammed E. Ali. "An Approach to Protect the Privacy of Cloud Data from Data Mining Based Attacks," in High Performance Computing, Networking, Storage and Analysis (SCC), 2012 SC Companion:, pp. 1106-1115. IEEE, 2012.

Aris Gkoulalas–Divanis;Vassilios S. Verykios, “Association Rule Hiding For Data Mining,” Springer, DOI 10.1007/978-1-4419-6569-1, Springer Science + Business Media, LLC 2010.

Vassilios S. Verykios, A.K. Elmagarmid, E. Bertino, Y. Saygin, and E. Dasseni, “Association Rule Hiding,” IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 4, pp. 434-447, 2004.

V. S. Verykios, Aris Gkoulalas-Divanis, “Privacy-Preserving Data Mining models and Algorithms,” Chapter 11, pp. 267–289, 2008.

Yi-Hung Wu, Chia-Ming Chiang, and Arbee L.P. Chen,”Hiding sensitive association rules with limited side effects,” IEEE Transactions On Knowledge And Data Engineering, Vol. 19, No. 1, January 2007.

M. Ahluwalia, A. Gangopadhyay, “Privacy preserving data mining:taxonomy of existing techniques,” in Computer Security, Privacy and Politics: Current Issues, Challenges and Solutions, R. Subramanian, Eds. New York: IRM Press, pp.70-93, 2008.

Guanling Lee, Chien-Yu Chang and Arbee L.P Chen,”Hiding sensitive patterns in association rule mining,” Proceedings of the 28th Annual International Computer Software and Applications Conference (COMPSAC’04), 2004.

Mahmoud. M. Mahmoud, Shawkat. K. Guirguis and Mohamed M. Abo rizka, "A Novel Approach for Identifying Sensitive Association Rules for Privacy Preserving Data Mining," IJICIS, Vol.13, No. 2, pp. 65-77, APRIL 2013.

Atallah M., Bertino E., Elmagarmid A., Ibrahim M., and Verykios V. “Disclosure Limitation of Sensitive Rules,” Proc. of IEEE Knowledge and Data Engineering Workshop, pages 45–52, Chicago, Illinois, November 1999.

S. Oliveira and O. Zaiane. “Privacy preserving frequent itemset mining,” CRPITS’14: Proceedings of the IEEE International Conference on Privacy, Security, and Data Mining, pp. 43–54, 2002.

S. Oliveira, O. Zaiane, “Protecting Sensitive Knowledge by Data Sanitization,” Proceedings of IEEE International Conference on Data Mining, November, 2003.

Shyue-Liang Wang, Bhavesh Parikh, Ayat Jafari, “Hiding informative association rule sets,” ELSEVIER, Expert Systems with Applications 33 (2007) pp. 316–323, 2006.

Shyue-LiangWang, Dipen Patel, Ayat Jafari and Tzung-Pei Hong, “Hiding collaborative recommendation association rules,” Published online: 30 January 2007, Springer Science+Business Media, LLC 2007.

Shyue-Liang Wang; Rajeev Maskey; Ayat Jafari; Tzung-Pei Hong “ Efficient sanitization of informative association rules,” ACM , Expert Systems with Applications: An International Journal, Volume 35, Issue 1-2, July, 2008.

Chih-Chia Weng; Shan-Tai Chen; Hung-Che Lo, “A Novel Algorithm for Completely Hiding Sensitive Association Rules,” IEEE Intelligent Systems Design and Applications, 2008.,vol 3, pp.202-208, 2008.

G. V. Moustakides and V. S. Verykios. "A maxmin approach for hiding frequent itemsets" Data and Knowledge Engineering, 65(1):75–89, 2008.

Modi, C. N., Rao, U.P., Patel, D.R., “Maintaining privacy and data quality in privacy preserving association rule mining,” 2010 Second International conference on Computing, Communication and Networking Technologies, pp. 1–6, Jul. 2010.

Vassilios S. Verykios, Ahmed K. Elmagarmid, Elisa Bertino, Yucel Saygin and Elena Dasseni, ”Association rule hiding,” IEEE Transactions On Knowledge And Data Engineering, Vol. 16, No. 4, April 2004.

C.C. Weng, S.T. Chen, and Y.C. Chang, “Novel Algorithms for Hiding Sensitive Frequent Itemsets,” Proceedings of the eighth International Symposium on Advanced Intelligent Systems, Sokcho-City, Korea, pp.753-757, 2007.

Yu-Chiang Lia, Jieh-Shan Yeh, Chin-Chen Chang, “MICF: An Effective sanitization algorithm for hiding sensitive patterns on data mining,” Advanced Engineering Informatics 21, no.3 pp. 269–280, 2007.

R. R. Rajalaxmi and A. M. Natarajan, “Hybrid Conflict Ratio for Hiding Sensitive Patterns with Minimum In-formation Loss,” International Journal of Computer Theory and Engineering, Vol. 1, No. 4, pp. 1793-8201, 2009.

K. S Rani and N V Muthu lakshmi, "A novel method for finding privacy preserving association rule mining," Indian Journal of Computer Science and Engineering (IJCSE), ISSN: 0976-5166 Vol. 3 No. 1 Feb -Mar 2012.

Hong, T. P., Lin, C. W., Yang, K. T. and Wang, S. L. "A heuristic data-sanitization approach based on TF-IDF," In Modern Approaches in Applied Intelligence, Springer Berlin Heidelberg, pp.156-164, 2011.

Hong, T. P., Lin, C. W., Yang, K. T. and Wang, S. L. "A lattice-based data sanitization approach," In Systems, Man, and Cybernetics (SMC), 2011 IEEE International Conference on IEEE, pp. 2325-2329, 2011.

Yıldız, Barış, and Belgin Ergenç. "Hiding Sensitive Predictive Frequent Itemsets," Proceedings of the International MultiConference of Engineers and Computer Scientists IMCS,Hong Komg, Vol. 1, 2011.

Selvi, Mrs P. Cynthia, and AR Mohamed Shanavas. "An Effective Heuristic Approach for Hiding Sensitive Patterns in Databases," IOSR Journal of Computer Engineering (IOSRJCE), ISSN: 2278-0661 Volume 5, Issue 1, PP. 06-11 Sep-Oct. 2012.

Nilesh R. Radadiya, Nilesh B. Prajapati and Krupali H. Shah," Privacy Preserving in Association Rule mining," IJAIR Vol. 2 Issue 4 ISSN: 2278-7844, pp. 208-213, 2013.

Agrawal R, and Srikant R. “Fast algorithms for mining association rules,” Proceedings of 20th international conference on very large data bases, Santiago, Chile, pp. 487-499, 1994.

R. Agrawal and R. Srikant. "Fast Algorithms for Mining Association Rules in Large Databases,” In Proceedings of the Twentieth VLDB, 1994.

L. Cristofor, “ARtool project,” 2002. [Online]. Available: [Accessed: May. 13, 2013].

Zheng Z, Kohavi R, Mason L. “Real World Performance of Association Rule Algorithms,” In Proc.7th Int. Conf. on Knowledge Discovery and Data Mining (SIGKDD’01). ACM Press, New York, NY, USA 2001.

Hahsler, M., Gr¨un, B., and Hornik, K., The arules package: Mining Association Rules and Frequent Itemsets, version 0.6-6, 2008.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.