Hiding Sensitive Association Rules by Elimination Selective Item among R.H.S Items for each Selective Transaction

Atefe Ramezani · Indian Journal of Science and Technology · 2014

This paper focuses on hiding sensitive association rule which is an important research problem in privacy preserving data mining. For this, we present an algorithm that decreases confidence of sensitive rules to below minimum threshold by removing selective item among items of consequent sensitive rule (R.H.S) for each selective transaction. Finally, we qualitatively compare the efficiency of the proposed algorithm with that of already published algorithms in hiding association rules. Keywords: Association Rule Minig, Datamining, Privacy Preserving

Read the paper · More papers on PaperTik