Call for Paper - November 2020 Edition
IJCA solicits original research papers for the November 2020 Edition. Last date of manuscript submission is October 20, 2020. Read More

Association Rule Hiding by Heuristic Approach to Reduce Side Effects and Hide Multiple R. H. S. Items

Print
PDF
International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 45 - Number 1
Year of Publication: 2012
Authors:
Komal Shah
Amit Thakkar
Amit Ganatra
10.5120/6741-7813

Komal Shah, Amit Thakkar and Amit Ganatra. Article: Association Rule Hiding by Heuristic Approach to Reduce Side Effects and Hide Multiple R.H.S. Items. International Journal of Computer Applications 45(1):1-7, May 2012. Full text available. BibTeX

@article{key:article,
	author = {Komal Shah and Amit Thakkar and Amit Ganatra},
	title = {Article: Association Rule Hiding by Heuristic Approach to Reduce Side Effects and Hide Multiple R.H.S. Items},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {45},
	number = {1},
	pages = {1-7},
	month = {May},
	note = {Full text available}
}

Abstract

Association rule mining is a powerful model of data mining used for finding hidden patterns in large databases. One of the great challenges of data mining is to protect the confidentiality of sensitive patterns when releasing database to third parties. Association rule hiding algorithms sanitize database such that certain sensitive association rules cannot be discovered through association rule mining techniques. In this study, we propose two algorithms, ADSRRC (Advanced Decrease Support of R. H. S. items of Rule Cluster) and RRLR (Remove and Reinsert L. H. S. of Rule), for hiding sensitive association rules. Both algorithms are developed to overcome limitations of existing rule hiding algorithm DSRRC (Decrease Support of R. H. S. items of Rule Cluster). Algorithm ADSRRC overcomes limitation of multiple sorting in database as well as it selects transaction to be modified based on different criteria than DSRRC algorithm. Algorithm RRLR overcomes limitation of hiding rules having multiple R. H. S. items. Experimental results show that both proposed algorithms outperform DSRRC in terms of side effects generated and data quality in most cases.

References

  • ArisGkoulalas–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
  • Elisa Bertino; Dan Lin; Wei Jiang," A Survey of Quantification of Privacy Preserving Data Mining Algorithms", Springer, Pages: 183–205,2008
  • RamakrishnanSrikant;"Privacy Preserving Data Mining: Challenges and Opportunities", PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, Springer-Verlag London, UK , 2002
  • Ahmed K. Elmagarmid; Amit P. Sheth , "Privacy-Preserving Data Mining Models and Algorithms - ADVANCES IN DATABASE SYSTEMS - Volume 34"
  • M. Atallah, E. Bertino, A. Elmagarmid, M. Ibrahim, and V. S. Verykios "Disclosure limitation of sensitive rules,". In Proc. of the 1999 IEEE Knowledge and Data Engineering Exchange Workshop (KDEX'99), pp. 45–52, 1999.
  • 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.
  • Shyue-Liang Wang; Bhavesh Parikh,; Ayat Jafari, "Hiding informative association rule sets", ELSEVIER, Expert Systems with Applications 33 (2007) 316–323,2006
  • Shyue-LiangWang ;Dipen Patel ;Ayat Jafari ;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
  • R. M. Oliveira; Osmar R. Za¨_ane, "Privacy Preserving Frequent Itemset Mining", IEEE International Conference on Data Mining Workshop on Privacy, Security, and Data Mining, Maebashi City, Japan. Conferences in Research and Practice in Information Technology, Vol. 14. 2002
  • 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
  • Modi, C. N. ; Rao, U. P. ; Patel, D. R. , "Maintaining privacy and data quality in privacy preserving association rule mining", IEEE 2008 Seventh International Conference on Machine Learning and Applications, pp 1-6, 2010
  • Y. Saygin, V. S. Verykios, and C. Clifton, "Using Unknowns to Prevent Discovery of Association Rules," ACM SIGMOD, vol. 30(4), pp. 45–54, Dec. 2001
  • H. Mannila and H. Toivonen, "Levelwise search and borders of theories in knowledge discovery," Data Mining and Knowledge Discovery, vol. 1(3), pp. 241–258, Sep. 1997.
  • X. Sun and P. S. Yu. Hiding sensitive frequent itemsets by a border–based approach. Computing science and engineering, 1(1):74–94, 2007.
  • A. Gkoulalas-Divanis and V. S. Verykios, "An Integer Programming Approach for Frequent Itemset Hiding," In Proc. ACM Conf. Information and Knowledge Management (CIKM '06), Nov. 2006.
  • A. Gkoulalas-Divanis and V. S. Verykios, "Exact Knowledge Hiding through Database Extension," IEEE Transactions on Knowledge and Data Engineering, vol. 21(5), pp. 699–713, May 2009.
  • Charu C. Aggarwal, Philip S. Yu, Privacy-Preserving Data Mining: Models and Algorithms. Springer Publishing Company Incorporated, 2008, pp. 267-286.