New Framework in Sensitive Rule Hiding

• Published in: International Journal of Computer Technology and Applications Vol. 3; no. 1; p. 182
• Main Authors: Naveenkumar, A S, Punithavalli, M
• Format: Journal Article
• Language: English
• Published: 01.01.2012
• Subjects: Algorithms; Data mining; Hides; Preserves; Preserving; Privacy; Transforms
• ISSN: 2229-6093

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.