New framework in Sensitive Rule Hiding

International Journal of Computer Trends and Technology (IJCTT)          
© - Issue 2012 by IJCTT Journal
Volume-3 Issue-1                           
Year of Publication : 2012
Authors :A.S. Naveenkumar ,Dr. M. Punithavalli.


A.S. Naveenkumar ,Dr. M. Punithavalli."New framework in Sensitive Rule Hiding"International Journal of Computer Trends and Technology (IJCTT),V3(1):25-29 Issue 2012 .ISSN Published by Seventh Sense Research Group.

Abstract: -Data mining is the process of extracting hidden patterns from data. As more data is gathered, with the amount of data doubling every three years, data mining is becoming an increasingly important tool to transform this data into information. Privacy preserving data mining is a novel research direction in data mining and statistical databases, which has recently been proposed in response to the concerns of preserving personal or sensible information derived from data mining algorithms. There have been two types of privacy proposed concerning data mining. The first type of privacy, called output privacy, is that the data is altered so that the mining result will preserve certain privacy. The second type of privacy, called input privacy, is that the data is manipulated so that the mining result is not affected or minimally affected. For output privacy in hiding association rules, current approaches require hidden rules or patterns to be given in advance. However, to specify hidden rules, entire data mining process needs to be executed. For some applications, only certain sensitive rules that contain sensitive items are required to hide. In this work, an algorithm ISSRH (Increase Support Sensitive Rule Hiding) is proposed, to hide the sensitive rules that contain sensitive items, so that sensitive rules containing specified sensitive items on the right hand side of the rule cannot be inferred through association rule mining.


[1] Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases.In: Proceedings of ACM SIGMOD International Conference on Management of Data, Washington DC
[2] Dasseni E, Verykios V, Elmagarmid A, Bertino E (2001) Hiding association rules by using confidence and support. In: Proceedings of 4th Information Hiding Workshop, Pittsburgh, PA, pp 369– 383
[3] Evfimievski A (2002) Randomization in privacy preserving data mining. SIGKDD Explorations 4(2), Issue 2:43–48
[4] Evfimievski A, Gehrke J, Srikant R (2003) Limiting Privacy Breaches in Privacy Preserving Data Mining. PODS 2003, San Diego, CA
[5] Evfimievski A, Srikant R, Agrawal R, Gehrke J (2002) Privacy preserving mining of association rules. In: Proceedings of the 8th ACMSIGKDD Int’l Conference on Knowledge Discovery and Data Mining, Edmonton, Canada
[6] Han, J., Kamber, M, ( 2001) Data Mining : Concepts and Techniques., Morgan Kaufmann Publishers.
[7] Oliveira S, Zaiane O (2002 a) Privacy preserving frequent item set mining. In: Proceedings of IEEE International Conference on Data Mining, November 2002, pp 43–54.
[8] Oliveira S, Zaiane O (2002 b) A framework for enforcing privacy in mining frequent patterns. Technical report,TR02-13, Computer Science Department, University of Alberta, Canada
[9] Oliveira S, Zaiane O (2003 a) Algorithms for balancing privacy and knowledge discovery in association rule mining. In: Proceedings of 7th International Database Engineering and Applications Symposium (IDEAS03), Hong Kong
[10] Oliveira S, Zaiane O (2003 b) Protecting sensitive knowledge by data sanitization. In: Proceedings of IEEE International Conference on Data Mining
[11] Saygin Y, Verykios V, Clifton C (2001) Using unknowns to prevent discovery of association rules. SIGMOND Record 30(4):45– 54
[12] Verykios V, Elmagarmid A, Bertino E, Saygin Y, Dasseni E (2004) Association Rules Hiding. IEEE Trans Knowedge and Data Eng 16(4):434– 447
[13] Yi-Hung Wu, Chia-Ming Chiang, and Arbee L.P. Chen, (2007), Hiding Sensitive Association Rules with Limited Side Effects, IEEE Trans Knowledge and Data Eng, Vol. 19, No. 1.

Keywords— Data Mining, Privacy Preserving, Association Rules, Sensitive Rules, Clustering, Minimum Support, Minimum confidence